A new exact method for the two-dimensional orthogonal packing problem
From MaRDI portal
Publication:2643952
DOI10.1016/j.ejor.2005.12.048zbMath1135.90045OpenAlexW2028761439MaRDI QIDQ2643952
Jacques Carlier, Aziz Moukrim, François Clautiaux
Publication date: 27 August 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.12.048
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
MPQ-trees for orthogonal packing problem, A hybrid evolutionary algorithm for the two-dimensional packing problem, A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem, A three-dimensional bin-packing model: exact multicriteria solution and computational complexity, Combinatorial Benders' Cuts for the Strip Packing Problem, Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem, Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints, An exact method for the 2D guillotine strip packing problem, Single batch machine scheduling with dual setup times for autoclave molding manufacturing, Optimal rectangle packing, A cutting plane method and a parallel algorithm for packing rectangles in a circular container, 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, 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, A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows, Maximizing revenue with allocation of multiple advertisements on a Web banner, Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem, The three-dimensional knapsack problem with balancing constraints, Rectangle packing with additional restrictions, New Filtering for the $\mathit{cumulative}$ Constraint in the Context of Non-Overlapping Rectangles, A new constraint programming approach for the orthogonal packing problem, A new exact method for the two-dimensional bin-packing problem with fixed orientation, A multi-objective genetic algorithm for a special type of 2D orthogonal packing problems, The value of integrating loading and routing, New filtering for the cumulative constraint in the context of non-overlapping rectangles, Consecutive ones matrices for multi-dimensional orthogonal packing problems, New lower bounds for bin packing problems with conflicts, Exact solution techniques for two-dimensional cutting and packing, Consecutive ones matrices for multi-dimensional orthogonal packing problems, The maximum diversity assortment selection problem, A hybrid metaheuristic for the two-dimensional strip packing problem, An efficient deterministic optimization approach for rectangular packing problems
Cites Work
- Unnamed Item
- Recent advances on two-dimensional bin packing problems
- 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
- The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
- The two-dimensional finite bin packing problem. II: New lower and upper bounds
- Two-dimensional packing problems: a survey
- An improved typology of cutting and packing problems
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- An Exact Approach to the Strip-Packing Problem
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- Bidimensional Packing by Bilinear Programming
- Two-Dimensional Finite Bin-Packing Algorithms
- Orthogonal Packings in Two Dimensions
- An Algorithm for Two-Dimensional Cutting Problems
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
- New classes of fast lower bounds for bin packing problems
