A new destructive bounding scheme for the bin packing problem
From MaRDI portal
Publication:610978
DOI10.1007/s10479-008-0459-2zbMath1203.90133OpenAlexW2061961069MaRDI QIDQ610978
Bassem Jarboui, Saber Ibrahim, Abdelwaheb Rebaï
Publication date: 13 December 2010
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-008-0459-2
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
- New bin packing fast lower bounds
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- The two-dimensional finite bin packing problem. II: New lower and upper bounds
- An analysis of lower bound procedures for the bin packing problem
- Ranking lower bounds for the bin-packing problem
- An improved lower bound for the bin packing problem
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- Fast lifting procedures for the bin packing problem
- An improved typology of cutting and packing problems
- Computing the asymptotic worst-case of bin packing lower bounds
- The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
- Capacitated Vehicle Routing on Trees
- Optimal Scheduling of Tasks on Identical Parallel Processors
- New classes of fast lower bounds for bin packing problems
This page was built for publication: A new destructive bounding scheme for the bin packing problem
