New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
From MaRDI portal
Publication:868985
DOI10.1016/j.cor.2005.08.012zbMath1144.90465OpenAlexW2050842780MaRDI QIDQ868985
Aziz Moukrim, François Clautiaux, Jacques Carlier
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
Related Items
MPQ-trees for orthogonal packing problem, Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem, Constrained order packing: comparison of heuristic approaches for a new bin packing problem, A hybrid algorithm for constrained order packing, A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem, A new exact method for the two-dimensional orthogonal packing problem, A three-dimensional bin-packing model: exact multicriteria solution and computational complexity, Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem, Compact integer linear programming formulations for the temporal bin packing problem with fire-ups, Worst-case analysis of maximal dual feasible functions, A constraint programming approach for a batch processing problem with non-identical job sizes, A new destructive bounding scheme for the bin packing problem, A survey of dual-feasible and superadditive functions, A preemptive bound for the resource constrained project scheduling problem, MPQ-trees for the orthogonal packing problem, A combinatorial flow-based formulation for temporal bin packing problems, Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems, A skyline heuristic for the 2D rectangular packing and strip packing problems, Conservative scales in packing problems, A new constraint programming approach for the orthogonal packing problem, Lower bounds and compact mathematical formulations for spacing soft constraints for university examination timetabling problems, Relations between capacity utilization, minimal bin size and bin number, Preprocessing and an improved MIP model for examination timetabling, A new exact method for the two-dimensional bin-packing problem with fixed orientation, A new lower bound for the non-oriented two-dimensional bin-packing problem, New resolution algorithm and pretreatments for the two-dimensional bin-packing problem, LP bounds in various constraint programming approaches for orthogonal packing, Enhanced energetic reasoning-based lower bounds for the resource constrained project scheduling problem, Lower bounds for three-dimensional multiple-bin-size bin packing problems, Theoretical investigations on maximal dual feasible functions, New lower bounds for bin packing problems with conflicts, Unnamed Item, Constructing general dual-feasible functions, Exact solution techniques for two-dimensional cutting and packing, Upper bounds for heuristic approaches to the strip packing problem, Determining the best shipper sizes for sending products to customers, A branch and bound algorithm for the strip packing problem, New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem
Cites Work
- Unnamed Item
- Unnamed Item
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- Lower bounds and reduction procedures for the 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
- A new LP-based lower bound for the cumulative scheduling problem
- New lower bounds for the three-dimensional finite bin packing problem
- An analysis of lower bound procedures for the bin packing problem
- Fast lifting procedures for the bin packing problem
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- Bidimensional Packing by Bilinear Programming
- Two-Dimensional Finite Bin-Packing Algorithms
- Orthogonal Packings in Two Dimensions
- Capacitated Vehicle Routing on Trees
- New classes of fast lower bounds for bin packing problems
