A new search procedure for the two-dimensional orthogonal packing problem
From MaRDI portal
Publication:894552
DOI10.1007/S10852-015-9278-ZzbMATH Open1335.90081OpenAlexW2130633654MaRDI QIDQ894552FDOQ894552
Authors: C. Pinto, Stéphane Grandcolas 
Publication date: 1 December 2015
Published in: Journal of Mathematical Modelling and Algorithms in Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10852-015-9278-z
Recommendations
- A new exact method for the two-dimensional orthogonal packing problem
- An exact algorithm for the two-dimensional strip-packing problem
- A new exact method for the two-dimensional bin-packing problem with fixed orientation
- A new constraint programming approach for the orthogonal packing problem
- Exact solution techniques for two-dimensional cutting and packing
Cites Work
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- An exact approach to the strip-packing problem
- The Three-Dimensional Bin Packing Problem
- A branch and bound algorithm for the strip packing problem
- A new exact method for the two-dimensional orthogonal packing problem
- Reactive GRASP for the strip-packing problem
- An exact algorithm for the two-dimensional strip-packing problem
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
- A new constraint programming approach for the orthogonal packing problem
- Optimal rectangle packing: an absolute placement approach
- Combinatorial Benders' cuts for the strip packing problem
- MPQ-trees for the orthogonal packing problem
- A SAT encoding for multi-dimensional packing problems
Cited In (8)
- Local search of orthogonal packings using the lower bounds
- MPQ-trees for orthogonal packing problem
- A new two-dimensional interleaving technique using successive packing
- A new constraint programming approach for the orthogonal packing problem
- A Constraint-Based Approach for the Two-Dimensional Rectangular Packing Problem with Orthogonal Orientations
- A multi-objective genetic algorithm for a special type of 2D orthogonal packing problems
- A hybrid metaheuristic for the two-dimensional strip packing problem
- A new exact method for the two-dimensional orthogonal packing problem
This page was built for publication: A new search procedure 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 Q894552)
