New resolution algorithm and pretreatments for the two-dimensional bin-packing problem

DOI10.1016/j.cor.2007.02.013zbMath1221.90076OpenAlexW1971792777MaRDI QIDQ2482368

Joseph El Hayek, Stéphane Negre, Aziz Moukrim

Publication date: 16 April 2008

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2007.02.013

zbMATH Keywords

heuristic algorithmscuttingbin-packingpretreatments

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (7)

Prospective Network Flow Models and Algorithms for Bin Packing Problems ⋮ Constrained order packing: comparison of heuristic approaches for a new bin packing problem ⋮ Sequential heuristic for the two-dimensional bin-packing problem ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ HEURISTICS WITH STOCHASTIC NEIGHBORHOOD STRUCTURES FOR TWO-DIMENSIONAL BIN PACKING AND CUTTING STOCK PROBLEMS ⋮ An open space based heuristic for the 2D strip packing problem with unloading constraints ⋮ Strips minimization in two-dimensional cutting stock of circular items

Cites Work

• Unnamed Item
• 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
• A lower bound for the non-oriented two-dimensional bin packing problem
• 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
• Exact Solution of the Two-Dimensional Finite Bin Packing Problem
• Guided Local Search for the Three-Dimensional Bin-Packing Problem
• The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
• Two-Dimensional Finite Bin-Packing Algorithms
• Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
• A New Placement Heuristic for the Orthogonal Stock-Cutting Problem

This page was built for publication: New resolution algorithm and pretreatments for the two-dimensional bin-packing problem