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.012zbMATH Open1144.90465OpenAlexW2050842780MaRDI QIDQ868985FDOQ868985
A. 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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Orthogonal Packings in Two Dimensions
- Exact solution of the two-dimensional finite bin packing problem
- Two-Dimensional Finite Bin-Packing Algorithms
- New classes of fast lower bounds for bin packing problems
- 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 general framework for bounds for higher-dimensional orthogonal packing problems.
- An analysis of lower bound procedures for the bin packing problem
- Fast lifting procedures for the bin packing problem
- Capacitated Vehicle Routing on Trees
- Lower bounds and reduction procedures for the bin packing problem
- New lower bounds for the three-dimensional finite bin packing problem
- A new LP-based lower bound for the cumulative scheduling problem
- Bidimensional Packing by Bilinear Programming
Cited In (38)
- Compact integer linear programming formulations for the temporal bin packing problem with fire-ups
- Exact solution techniques for two-dimensional cutting and packing
- Worst-case analysis of maximal dual feasible functions
- Conservative scales in packing problems
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
- Lower bounds and compact mathematical formulations for spacing soft constraints for university examination timetabling problems
- A computational study of lower bounds for the two dimensional bin packing problem
- New lower bounds for bin packing problems with conflicts
- MPQ-trees for orthogonal packing problem
- Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem
- Constructing general dual-feasible functions
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- Constrained order packing: comparison of heuristic approaches for a new bin packing problem
- A hybrid algorithm for constrained order packing
- New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem
- A survey of dual-feasible and superadditive functions
- Lower bounds for three-dimensional multiple-bin-size bin packing problems
- A preemptive bound for the resource constrained project scheduling problem
- Theoretical investigations on maximal dual feasible functions
- A new constraint programming approach for the orthogonal packing problem
- Determining the best shipper sizes for sending products to customers
- Upper bounds for heuristic approaches to the strip packing problem
- Enhanced energetic reasoning-based lower bounds 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
- Preprocessing and an improved MIP model for examination timetabling
- A new destructive bounding scheme for the bin packing problem
- A combinatorial flow-based formulation for temporal bin packing problems
- A three-dimensional bin-packing model: exact multicriteria solution and computational complexity
- A new exact method for the two-dimensional bin-packing problem with fixed orientation
- A constraint programming approach for a batch processing problem with non-identical job sizes
- Relations between capacity utilization, minimal bin size and bin number
- MPQ-trees for the orthogonal packing problem
- Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems
- 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
- A new exact method for the two-dimensional orthogonal packing problem
- A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing 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)
