Worst-case analyses, linear programming and the bin-packing problem
From MaRDI portal
Publication:1290661
zbMath0920.90121MaRDI QIDQ1290661
David Simchi-Levi, Julien Bramel, Lap Mui Ann Chan
Publication date: 23 September 1999
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
bin-packingbest fit decreasingfirst fit decreasingset-partitioningabsolute performance ratioworst-case bound on the performance
Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Combinatorial optimization (90C27)
Related Items (11)
Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ On the bin packing problem with a fixed number of object weights ⋮ Exact and approximate methods for the score-constrained packing problem ⋮ Product packing and stacking under uncertainty: a robust approach ⋮ The proper relaxation and the proper gap of the skiving stock problem ⋮ Lower bounds and algorithms for the 2-dimensional vector packing problem ⋮ Scheduling multiple orders per job in a single machine to minimize total completion time ⋮ Bidimensional packing by bilinear programming ⋮ A branch-and-price algorithm for the temporal bin packing problem ⋮ Friendly bin packing instances without integer round-up property ⋮ Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
This page was built for publication: Worst-case analyses, linear programming and the bin-packing problem
