An analysis of lower bound procedures for the bin packing problem

DOI10.1016/S0305-0548(03)00244-2zbMath1077.90035OpenAlexW2078289810MaRDI QIDQ1886845

Jean-Marie Bourjolly, Vianney Rebetez

Publication date: 19 November 2004

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

Full work available at URL: https://doi.org/10.1016/s0305-0548(03)00244-2

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items

Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ Computing the asymptotic worst-case of bin packing lower bounds ⋮ New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation ⋮ A three-dimensional bin-packing model: exact multicriteria solution and computational complexity ⋮ New bin packing fast lower bounds ⋮ A new destructive bounding scheme for the bin packing problem ⋮ SALSA: combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing ⋮ Integrated production and distribution scheduling with a perishable product ⋮ Lower bounds for a bin packing problem with linear usage cost ⋮ Bin packing problem with conflicts and item fragmentation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower bounds and reduction procedures for the bin packing problem
• Assembly line balancing as generalized bin packing
• Branch-and-bound algorithms for the multi-product assembly line balancing problem
• Capacitated Vehicle Routing on Trees
• An Application of Bin-Packing to Multiprocessor Scheduling
• Optimal Scheduling of Tasks on Identical Parallel Processors
• The Loading Problem