A new constraint programming approach for the orthogonal packing problem
From MaRDI portal
Publication:2456654
DOI10.1016/j.cor.2006.05.012zbMath1278.90147OpenAlexW2136790460MaRDI QIDQ2456654
Aziz Moukrim, Antoine Jouglet, Jacques Carlier, François Clautiaux
Publication date: 19 October 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.05.012
Related Items
Prospective Network Flow Models and Algorithms for Bin Packing Problems, MPQ-trees for orthogonal packing problem, An extension of Queiroz and Miyazawa's method for vertical stability in two-dimensional packing problems to deal with horizontal stability, Logic based Benders' decomposition for orthogonal stock cutting problems, Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem, Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem, An exact method for the 2D guillotine strip packing problem, An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery, A novel non-linear approach to minimal area rectangular packing, Optimal rectangle packing, Routing problems with loading constraints, The off-line group seat reservation problem, An introduction to the two‐dimensional rectangular cutting and packing problem, MPQ-trees for the orthogonal packing problem, A new search procedure for the two-dimensional orthogonal packing problem, A squeaky wheel optimisation methodology for two-dimensional strip packing, An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem, A skyline heuristic for the 2D rectangular packing and strip packing problems, Conservative scales in packing problems, The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers, Rectangle packing with additional restrictions, The Meet-in-the-Middle Principle for Cutting and Packing Problems, New Filtering for the $\mathit{cumulative}$ Constraint in the Context of Non-Overlapping Rectangles, A multi-objective genetic algorithm for a special type of 2D orthogonal packing problems, A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates, LP bounds in various constraint programming approaches for orthogonal packing, Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts, New filtering for the cumulative constraint in the context of non-overlapping rectangles, Consecutive ones matrices for multi-dimensional orthogonal packing problems, Multi-dimensional bin packing problems with guillotine constraints, 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, Consecutive ones matrices for multi-dimensional orthogonal packing problems, One-dimensional relaxations and LP bounds for orthogonal packing, Heuristics for container loading of furniture, An efficient deterministic optimization approach for rectangular packing problems, 2DPackLib: a two-dimensional cutting and packing library
Uses Software
Cites Work
- 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
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- Constraint-based scheduling: Applying constraint programming to scheduling problems.
- The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
- On the two-dimensional knapsack problem
- Satisfiability tests and time-bound adjustments for cumulative scheduling problems
- A new exact method for the two-dimensional bin-packing problem with fixed orientation
- Sweep synchronization as a global propagation mechanism
- An improved typology of cutting and packing problems
- A new exact method for the two-dimensional orthogonal packing problem
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
- New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- Bidimensional Packing by Bilinear Programming
- An Algorithm for Two-Dimensional Cutting Problems
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
- Unnamed Item
- Unnamed Item
- Unnamed Item
