A lower bound for the non-oriented two-dimensional bin packing problem
From MaRDI portal
Publication:1348248
DOI10.1016/S0166-218X(01)00253-0zbMath0995.90080OpenAlexW1997445317WikidataQ59222293 ScholiaQ59222293MaRDI QIDQ1348248
Mauro Dell'Amico, Silvano Martello, Daniele Vigo
Publication date: 15 May 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(01)00253-0
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items
Prospective Network Flow Models and Algorithms for Bin Packing Problems, MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS, A heuristic for solving large bin packing problems in two and three dimensions, Constrained order packing: comparison of heuristic approaches for a new bin packing problem, A hybrid algorithm for constrained order packing, Sequential heuristic for the two-dimensional bin-packing problem, Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts, Models and algorithms for packing rectangles into the smallest square, Packing into the smallest square: worst-case analysis of lower bounds, Single batch machine scheduling with dual setup times for autoclave molding manufacturing, A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts, A sequential value correction heuristic for a bi-objective two-dimensional bin-packing, A new lower bound for the non-oriented two-dimensional bin-packing problem, Ant colony optimization for the two-dimensional loading vehicle routing problem, A hybrid feasibility constraints-guided search to the two-dimensional bin packing problem with due dates, New resolution algorithm and pretreatments for the two-dimensional bin-packing problem, Recent advances on two-dimensional bin packing problems, Two-dimensional online bin packing with rotation, An agent-based approach to the two-dimensional guillotine bin packing problem, Deterministic model for customized pilot manufacture production with various backplane sizes, The two-dimensional bin packing problem with variable bin sizes and costs
Cites Work
- Unnamed Item
- Packing problems
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- The Three-Dimensional Bin Packing Problem
- A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem
