The Set Packing Problem is a combinatorial decision problem where the objective is to determine if there exists a collection of disjoint subsets from a given set of subsets such that the collection ...

The beginning of the quantum era has increased the hype around computationally demanding problems and, particularly, NP-complete problems. One of the most famous is the Set Packing, which has several ...

This project focuses on solving the Perfect Weighted Packing (PWP) problem, which involves packing a set of rectangles into a strip without overlapping, using two different approaches: Constraint ...

The stochastic matching problem deals with finding a maximum matching in a graph whose edges are unknown but can be accessed via queries. This is a special case of stochastic k-set packing, where the ...

The Journal of the Operational Research Society, Vol. 69, No. 3 (MARCH 2018), pp. 402-415 (14 pages) This paper presents a heuristic for the guillotine two-dimensional bin packing problem, where a set ...