Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs
From MaRDI portal
Publication:5444986
DOI10.1007/978-3-540-74240-1_42zbMath1135.90392OpenAlexW1513839537MaRDI QIDQ5444986
Omer Yehezkely, Hadas Shachnai
Publication date: 26 February 2008
Published in: Fundamentals of Computation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-74240-1_42
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (9)
Exactly solving packing problems with fragmentation ⋮ A note on a variant of the online open end bin packing problem ⋮ A faster FPTAS for the unbounded knapsack problem ⋮ New formulations for variable cost and size bin packing problems with item fragmentation ⋮ Approximation schemes for packing splittable items with cardinality constraints ⋮ Bin packing with general cost structures ⋮ Improved results for a memory allocation problem ⋮ An improved approximation scheme for variable-sized bin packing ⋮ The basic train makeup problem in shunting yards
This page was built for publication: Fast Asymptotic FPTAS for Packing Fragmentable Items with Costs
