A new exact method for the two-dimensional bin-packing problem with fixed orientation

DOI10.1016/J.ORL.2006.06.007zbMATH Open1169.90430OpenAlexW2029137835MaRDI QIDQ2467477FDOQ2467477

A. Moukrim, Jacques Carlier, François Clautiaux

Publication date: 21 January 2008

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2006.06.007

zbMATH Keywords

lower boundscutting and packingbranch-and-bounddual-feasible functions

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Cites Work

• Title not available (Why is that?)
• An improved typology of cutting and packing problems
• Exact solution of the two-dimensional finite bin packing problem
• A set-covering-based heuristic approach for bin-packing problems
• Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
• Two-Dimensional Finite Bin-Packing Algorithms
• The Three-Dimensional Bin Packing Problem
• New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
• The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
• A new exact method for the two-dimensional orthogonal packing problem
• The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
• A general framework for bounds for higher-dimensional orthogonal packing problems.
• New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem
• Bidimensional Packing by Bilinear Programming

Cited In (11)

• A computational study of lower bounds for the two dimensional bin packing problem
• A skyline heuristic for the 2D rectangular packing and strip packing problems
• New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem
• A new constraint programming approach for the orthogonal packing problem
• New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
• A Constraint-Based Approach for the Two-Dimensional Rectangular Packing Problem with Orthogonal Orientations
• Integrated topology optimization with embedded movable holes based on combined description by material density and level sets
• The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers
• Deterministic model for customized pilot manufacture production with various backplane sizes
• A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem
• Optimal packing configuration design with finite-circle method

This page was built for publication: A new exact method for the two-dimensional bin-packing problem with fixed orientation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467477)