A new exact method for the two-dimensional orthogonal packing problem
From MaRDI portal
Publication:2643952
DOI10.1016/J.EJOR.2005.12.048zbMATH Open1135.90045OpenAlexW2028761439MaRDI QIDQ2643952FDOQ2643952
Authors: François Clautiaux, Jacques Carlier, A. Moukrim 
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
Recommendations
- A new constraint programming approach for the orthogonal packing problem
- A new search procedure for the two-dimensional orthogonal packing problem
- Exact solution techniques for two-dimensional cutting and packing
- A new exact method for the two-dimensional bin-packing problem with fixed orientation
- An exact algorithm for the two-dimensional strip-packing problem
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Title not available (Why is that?)
- An improved typology of cutting and packing problems
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- Two-dimensional packing problems: a survey
- Orthogonal Packings in Two Dimensions
- Exact solution of the two-dimensional finite bin packing problem
- An exact approach to the strip-packing problem
- Two-Dimensional Finite Bin-Packing Algorithms
- An Algorithm for Two-Dimensional Cutting Problems
- New classes of fast lower bounds for bin packing problems
- Recent advances on two-dimensional bin 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
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
- Bidimensional Packing by Bilinear Programming
Cited In (40)
- Exact solution techniques for two-dimensional cutting and packing
- An introduction to the two‐dimensional rectangular cutting and packing problem
- New Filtering for the $\mathit{cumulative}$ Constraint in the Context of Non-Overlapping Rectangles
- The value of integrating loading and routing
- Consecutive ones matrices for multi-dimensional orthogonal packing problems
- New filtering for the cumulative constraint in the context of non-overlapping rectangles
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
- Title not available (Why is that?)
- New lower bounds for bin packing problems with conflicts
- MPQ-trees for orthogonal packing problem
- Consecutive ones matrices for multi-dimensional orthogonal packing problems
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem
- One-dimensional relaxations and LP bounds for orthogonal packing
- A hybrid evolutionary algorithm for the two-dimensional packing problem
- An exact method for the 2D guillotine strip packing problem
- A new constraint programming approach for the orthogonal packing problem
- A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows
- The maximum diversity assortment selection problem
- LP bounds in various constraint programming approaches for orthogonal packing
- A Constraint-Based Approach for the Two-Dimensional Rectangular Packing Problem with Orthogonal Orientations
- Combinatorial Benders' cuts for the strip packing problem
- A new search procedure for the two-dimensional orthogonal packing problem
- A new nonlinear model for the two-dimensional rectangle packing problem
- Single batch machine scheduling with dual setup times for autoclave molding manufacturing
- Maximizing revenue with allocation of multiple advertisements on a Web banner
- A three-dimensional bin-packing model: exact multicriteria solution and computational complexity
- A new exact method for the two-dimensional bin-packing problem with fixed orientation
- A cutting plane method and a parallel algorithm for packing rectangles in a circular container
- The three-dimensional knapsack problem with balancing constraints
- Learning-based branch-and-price algorithms for the vehicle routing problem with time windows and two-dimensional loading constraints
- Optimal rectangle packing
- A multi-objective genetic algorithm for a special type of 2D orthogonal packing problems
- A hybrid metaheuristic for the two-dimensional strip packing problem
- An efficient deterministic optimization approach for rectangular packing problems
- MPQ-trees for the orthogonal packing problem
- Rectangle packing with additional restrictions
- An exact algorithm for the two-dimensional stage-unrestricted guillotine cutting/packing decision problem
- A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem
- Title not available (Why is that?)
This page was built for publication: A new exact method for the two-dimensional orthogonal packing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643952)
