6 search results - page 1 / 2 » A General Framework for Bounds for Higher-Dimensional Orthog... |
CORR
2004
Springer
13 years 4 months ago
2004
Springer
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. In the context of a branch-and-bound framewo...
EOR
2007
13 years 4 months ago
2007
The two-dimensional orthogonal non-guillotine cutting problem (NGCP) appears in many industries (like wood and steel industries) and consists in cutting a rectangular master surfa...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
COMPGEOM
2004
ACM
13 years 10 months ago
2004
ACM
We consider the problem of constructing binary space partitions (BSPs) for orthogonal subdivisions (space filling packings of boxes) in d-space. We show that a subdivision with n...
FOCS
2006
IEEE
13 years 10 months ago
2006
IEEE
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...