Worst-case analysis of the subset sum algorithm for bin packing.
From MaRDI portal
Publication:1417595
DOI10.1016/S0167-6377(03)00092-0zbMath1060.90061WikidataQ61638372 ScholiaQ61638372MaRDI QIDQ1417595
Ulrich Pferschy, Alberto Caprara
Publication date: 5 January 2004
Published in: Operations Research Letters (Search for Journal in Brave)
Related Items (18)
A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services ⋮ Constrained order packing: comparison of heuristic approaches for a new bin packing problem ⋮ A hybrid algorithm for constrained order packing ⋮ Selfish bin packing with cardinality constraints ⋮ Lower and upper bounding procedures for the bin packing problem with concave loading cost ⋮ Online variable-sized bin packing with conflicts ⋮ Quality of equilibria for selfish bin packing with cost sharing variants ⋮ Selfish Bin Packing ⋮ Matheuristics for the irregular bin packing problem with free rotations ⋮ Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem ⋮ Selfish bin packing ⋮ Relaxations and exact solution of the variable sized bin packing problem ⋮ Efficient algorithms for real-life instances of the variable size bin packing problem ⋮ Heuristics for the variable sized bin-packing problem ⋮ Quality of strong equilibria for selfish bin packing with uniform cost sharing ⋮ A successive approximation algorithm for the multiple knapsack problem ⋮ Modified subset sum heuristics for bin packing ⋮ Parametric packing of selfish items and the subset sum algorithm
Uses Software
Cites Work
- Unnamed Item
- Fast algorithms for bin packing
- Dynamic programming revisited: Improving knapsack algorithms
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
- Linear Time Algorithms for Knapsack Problems with Bounded Weights
- New heuristics for one-dimensional bin-packing
This page was built for publication: Worst-case analysis of the subset sum algorithm for bin packing.