A new exact method for the two-dimensional orthogonal packing problem
From MaRDI portal
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
Cites work
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- An Algorithm for Two-Dimensional Cutting Problems
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- An exact approach to the strip-packing problem
- An improved typology of cutting and packing problems
- Bidimensional Packing by Bilinear Programming
- Exact solution of the two-dimensional finite bin packing problem
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- New classes of fast lower bounds for bin packing problems
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- Orthogonal Packings in Two Dimensions
- Recent advances on two-dimensional bin packing 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 Finite Bin-Packing Algorithms
- Two-dimensional packing problems: a survey
Cited in
(44)- The value of integrating loading and routing
- LP bounds in various constraint programming approaches for orthogonal packing
- MPQ-trees for the orthogonal packing problem
- A multi-objective genetic algorithm for a special type of 2D orthogonal packing problems
- Exact solution techniques for two-dimensional cutting and packing
- The maximum diversity assortment selection problem
- A hybrid metaheuristic for the two-dimensional strip packing problem
- A three-dimensional bin-packing model: exact multicriteria solution and computational complexity
- A new constraint programming approach for the orthogonal packing problem
- A new exact method for the two-dimensional bin-packing problem with fixed orientation
- Single batch machine scheduling with dual setup times for autoclave molding manufacturing
- A cutting plane method and a parallel algorithm for packing rectangles in a circular container
- An efficient deterministic optimization approach for rectangular packing problems
- MPQ-trees for orthogonal packing problem
- A new nonlinear model for the two-dimensional rectangle packing problem
- Combinatorial Benders' cuts for the strip packing problem
- An exact algorithm for the two-dimensional stage-unrestricted guillotine cutting/packing decision problem
- A hybrid evolutionary algorithm for the two-dimensional packing problem
- One-dimensional relaxations and LP bounds for orthogonal packing
- scientific article; zbMATH DE number 1183280 (Why is no real title available?)
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- scientific article; zbMATH DE number 1225305 (Why is no real title available?)
- Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem
- The three-dimensional knapsack problem with balancing constraints
- A theoretical and experimental study of fast lower bounds for the two-dimensional bin 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
- New Filtering for the $\mathit{cumulative}$ Constraint in the Context of Non-Overlapping Rectangles
- A Constraint-Based Approach for the Two-Dimensional Rectangular Packing Problem with Orthogonal Orientations
- New filtering for the cumulative constraint in the context of non-overlapping rectangles
- Consecutive ones matrices for multi-dimensional orthogonal packing problems
- Consecutive ones matrices for multi-dimensional orthogonal packing problems
- An introduction to the two‐dimensional rectangular cutting and packing problem
- An exact method for the 2D guillotine strip packing problem
- Optimal rectangle packing
- 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
- Rectangle packing with additional restrictions
- Solving the strip packing problem with a decomposition framework and a generic solver: implementation, tuning, and reinforcement-learning-based hybridization
- Solving the parallel processor scheduling and bin packing problems with contiguity constraints: mathematical models and computational studies
- A new branch-and-cut approach for integrated planning in additive manufacturing
- Combinatorial Benders decomposition for single machine scheduling in additive manufacturing with two-dimensional packing constraints
- A new search procedure for the two-dimensional orthogonal packing problem
- New lower bounds for bin packing problems with conflicts
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)
