Approximation and Online Algorithms
From MaRDI portal
Publication:5898484
DOI10.1007/11671411zbMath1177.90352OpenAlexW4210634114MaRDI QIDQ5898484
Tami Tamir, Omer Yehezkely, Hadas Shachnai
Publication date: 12 February 2007
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11671411
Related Items (6)
Mathematical programming algorithms for bin packing problems with item fragmentation ⋮ The bin packing problem with item fragmentation: a worst-case analysis ⋮ Approximation Schemes for Packing Splittable Items with Cardinality Constraints ⋮ The basic train makeup problem in shunting yards ⋮ Matrix columns allocation problems ⋮ On lazy bin covering and packing problems
This page was built for publication: Approximation and Online Algorithms
