A new search procedure for the two-dimensional orthogonal packing problem

DOI10.1007/s10852-015-9278-zzbMath1335.90081OpenAlexW2130633654MaRDI QIDQ894552

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

zbMATH Keywords

strip packingorthogonal packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (2)

A multi-objective genetic algorithm for a special type of 2D orthogonal packing problems ⋮ A hybrid metaheuristic for the two-dimensional strip packing problem

Cites Work

• Reactive GRASP for the strip-packing problem
• A branch and bound algorithm for the strip packing problem
• Exact algorithms for the two-dimensional strip packing problem with and without rotations
• An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
• MPQ-trees for the orthogonal packing problem
• A new constraint programming approach for the orthogonal packing problem
• A new exact method for the two-dimensional orthogonal packing problem
• An Exact Approach to the Strip-Packing Problem
• Combinatorial Benders' Cuts for the Strip Packing Problem
• An Exact Algorithm for the Two-Dimensional Strip-Packing Problem
• An Exact Algorithm for Higher-Dimensional Orthogonal Packing
• A SAT Encoding for Multi-dimensional Packing Problems
• A Branch-and-Bound Procedure for the Multiple Resource-Constrained Project Scheduling Problem
• The Three-Dimensional Bin Packing Problem
• Optimal Rectangle Packing: An Absolute Placement Approach
• Recursive Computational Procedure for Two-dimensional Stock Cutting
• A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing

This page was built for publication: A new search procedure for the two-dimensional orthogonal packing problem