Ranking lower bounds for the bin-packing problem
From MaRDI portal
Publication:1887861
DOI10.1016/J.EJOR.2003.06.019zbMATH Open1067.90137OpenAlexW2022759528MaRDI QIDQ1887861FDOQ1887861
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Decomposition Principle for Linear Programs
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Districting for salt spreading operations
- The integration of an interior-point cutting plane method within a branch-and-price algorithm
- Solving binary cutting stock problems by column generation and branch- and-bound
Cited In (11)
- Fast lifting procedures for the bin packing problem
- Optimum service capacity and demand management with price incentives
- Energetic reasoning and bin-packing problem, for bounding a parallel machine scheduling problem
- Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs
- On the bin packing problem with a fixed number of object weights
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- A new destructive bounding scheme for the bin packing problem
- Comments on the hierarchically structured bin packing problem
- Lower bounds and reduction procedures for the bin packing problem
- Characterizing the optimality gap and the optimal packings for the bin packing problem
- Bin packing with ``largest in bottom constraint: tighter bounds and generalizations
Uses Software
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)
