LP bounds in various constraint programming approaches for orthogonal packing
From MaRDI portal
Publication:1761178
DOI10.1016/j.cor.2011.12.010zbMath1251.90331OpenAlexW2055991662MaRDI QIDQ1761178
Guntram Scheithauer, Gleb Belov, M. A. Mesyagutov
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.12.010
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Combinatorial aspects of packing and covering (05B40)
Related Items
Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem, A cutting plane method and a parallel algorithm for packing rectangles in a circular container, The Meet-in-the-Middle Principle for Cutting and Packing Problems, LP bounds in various constraint programming approaches for orthogonal packing, Practical constraints in the container loading problem: comprehensive formulations and exact algorithm, Exact solution techniques for two-dimensional cutting and packing, The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem, 2DPackLib: a two-dimensional cutting and packing library
Uses Software
Cites Work
- New filtering for the cumulative constraint in the context of non-overlapping rectangles
- Optimal rectangle packing
- A survey of dual-feasible and superadditive functions
- Packing of one-dimensional bins with contiguous selection of identical items: an exact method of optimal solution
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
- Cutting and packing optimization. Problems modeling and solution methods.
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
- A branch and bound algorithm for the strip packing problem
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- Packing small boxes into a big box.
- Exact algorithms for the guillotine strip cutting/packing problem.
- The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- LP bounds in various constraint programming approaches for orthogonal packing
- Conservative scales in packing problems
- A new constraint programming approach for the orthogonal packing problem
- An improved typology of cutting and packing problems
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- An Exact Approach to the Strip-Packing Problem
- Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Bounds for Two-Dimensional Cutting
- A Linear Programming Approach to the Cutting-Stock Problem
- One-dimensional relaxations and LP bounds for orthogonal packing
- Principles of Constraint Programming
- One-dimensional heuristics adapted for two-dimensional rectangular strip packing
- New Filtering for the $\mathit{cumulative}$ Constraint in the Context of Non-Overlapping Rectangles
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
- New classes of fast lower bounds for bin packing problems
