Ranking lower bounds for the bin-packing problem

DOI10.1016/J.EJOR.2003.06.019MaRDI QIDQ1887861zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• An analysis of lower bound procedures for the bin packing problem
• scientific article; zbMATH DE number 1187157
• An improved lower bound for the bin packing problem
• A computational study of lower bounds for the two dimensional bin packing problem
• New bin packing fast lower bounds

Cites work

• scientific article; zbMATH DE number 3890754 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• scientific article; zbMATH DE number 2084780 (Why is no real title available?)
• scientific article; zbMATH DE number 1452994 (Why is no real title available?)
• BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
• Computational study of a column generation algorithm for bin packing and cutting stock problems
• Decomposition Principle for Linear Programs
• Districting for salt spreading operations
• 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
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• The integration of an interior-point cutting plane method within a branch-and-price algorithm

Cited in

(12)

• Lower bounds and reduction procedures for the bin packing problem
• An analysis of lower bound procedures for the bin packing problem
• Characterizing the optimality gap and the optimal packings for the bin packing problem
• 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
• Bin packing with ``largest in bottom constraint: tighter bounds and generalizations
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• Fast lifting procedures for the bin packing problem
• A new destructive bounding scheme for the bin packing problem
• Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs
• Comments on the hierarchically structured bin packing problem

Describes a project that uses

Uses Software

• Bison

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1887861)