New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation

DOI10.1016/J.COR.2005.08.012MaRDI QIDQ868985zbMATH OpenOpenAlexFDO

Authors Jacques Carlier, François Clautiaux, A. Moukrim

Publication date 26 February 2007

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

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

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• 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
• New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem
• A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem
• A new lower bound for the non-oriented two-dimensional bin-packing problem

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A general framework for bounds for higher-dimensional orthogonal packing problems.
• A new LP-based lower bound for the cumulative scheduling problem
• An analysis of lower bound procedures for the bin packing problem
• Bidimensional Packing by Bilinear Programming
• Capacitated Vehicle Routing on Trees
• Exact solution of the two-dimensional finite bin packing problem
• Fast lifting procedures for the bin packing problem
• Lower bounds and reduction procedures for the bin packing problem
• New classes of fast lower bounds for bin packing problems
• New lower bounds for the three-dimensional finite bin packing problem
• Orthogonal Packings in Two Dimensions
• 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

Cited in

(39)

• A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem
• A new lower bound for the non-oriented two-dimensional bin-packing problem
• Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
• Preprocessing and an improved MIP model for examination timetabling
• A new exact method for the two-dimensional orthogonal packing problem
• Lower bounds for three-dimensional multiple-bin-size bin packing problems
• New lower bounds for bin packing problems with conflicts
• New resolution algorithm and pretreatments for the two-dimensional bin-packing problem
• Worst-case analysis of maximal dual feasible functions
• A survey of dual-feasible and superadditive functions
• Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems
• The two-dimensional finite bin packing problem. I: New lower bounds for the oriented case
• A three-dimensional bin-packing model: exact multicriteria solution and computational complexity
• Exact solution techniques for two-dimensional cutting and packing
• MPQ-trees for the orthogonal packing problem
• Conservative scales in packing problems
• Determining the best shipper sizes for sending products to customers
• Upper bounds for heuristic approaches to the strip packing problem
• A preemptive bound for the resource constrained project scheduling problem
• LP bounds in various constraint programming approaches for orthogonal packing
• A branch and bound algorithm for the strip packing problem
• MPQ-trees for orthogonal packing problem
• Constructing general dual-feasible functions
• Constrained order packing: comparison of heuristic approaches for a new bin packing problem
• A hybrid algorithm for constrained order packing
• A combinatorial flow-based formulation for temporal bin packing problems
• New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem
• A constraint programming approach for a batch processing problem with non-identical job sizes
• Relations between capacity utilization, minimal bin size and bin number
• A computational study of lower bounds for the two dimensional bin packing problem
• Theoretical investigations on maximal dual feasible functions
• Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
• A skyline heuristic for the 2D rectangular packing and strip packing problems
• Lower bounds and compact mathematical formulations for spacing soft constraints for university examination timetabling problems
• A new destructive bounding scheme for the bin packing problem
• A new constraint programming approach for the orthogonal packing problem
• Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
• A new exact method for the two-dimensional bin-packing problem with fixed orientation
• Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem

This page was built for publication: New reduction procedures and lower bounds 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 Q868985)