Ranking lower bounds for the bin-packing problem

DOI10.1016/j.ejor.2003.06.019zbMath1067.90137OpenAlexW2022759528MaRDI QIDQ1887861

Samir Elhedhli

Publication date: 22 November 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2003.06.019

zbMATH Keywords

Lagrangean relaxationInteger programmingBin-packing

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (7)

Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ Optimum service capacity and demand management with price incentives ⋮ On the bin packing problem with a fixed number of object weights ⋮ Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem ⋮ A new destructive bounding scheme for the bin packing problem ⋮ Characterizing the optimality gap and the optimal packings for the bin packing problem ⋮ Fast lifting procedures for the bin packing problem

Uses Software

• Bison

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exact solution of bin-packing problems using column generation and branch-and-bound
• Solving binary cutting stock problems by column generation and branch- and-bound
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
• Districting for salt spreading operations
• The integration of an interior-point cutting plane method within a branch-and-price algorithm
• Computational study of a column generation algorithm for bin packing and cutting stock problems
• Decomposition Principle for Linear Programs
• The Lagrangian Relaxation Method for Solving Integer Programming Problems

This page was built for publication: Ranking lower bounds for the bin-packing problem