New bin packing fast lower bounds

DOI10.1016/j.cor.2006.02.007zbMath1127.90055OpenAlexW2090707079WikidataQ58644540 ScholiaQ58644540MaRDI QIDQ883309

Teodor Gabriel Crainic, Guido Perboli, Miriam Pezzuto, Roberto Tadei

Publication date: 4 June 2007

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

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

zbMATH Keywords

lower boundsbin packing

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

Logistics capacity planning: a stochastic bin packing formulation and a progressive hedging meta-heuristic ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ Computing the asymptotic worst-case of bin packing lower bounds ⋮ A three-dimensional bin-packing model: exact multicriteria solution and computational complexity ⋮ A new destructive bounding scheme for the bin packing problem ⋮ A generalized bin packing problem for parcel delivery in last-mile logistics ⋮ Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem ⋮ Bin packing problem with conflicts and item fragmentation

Uses Software

• OR-Library
• Bison

Cites Work

• Unnamed Item
• Unnamed Item
• Lower bounds and reduction procedures for the bin packing problem
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
• An analysis of lower bound procedures for the bin packing problem
• An improved lower bound for the bin packing problem
• A tight lower bound for optimal bin packing
• Heuristics for the integer one-dimensional cutting stock problem: A computational study
• Computational study of a column generation algorithm for bin packing and cutting stock problems
• Fast lifting procedures for the bin packing problem
• Computing the asymptotic worst-case of bin packing lower bounds
• A Linear Programming Approach to the Cutting-Stock Problem
• The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
• Capacitated Vehicle Routing on Trees
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• New classes of fast lower bounds for bin packing problems