Approximation schemes for packing with item fragmentation
From MaRDI portal
Publication:927410
DOI10.1007/s00224-007-9082-xzbMath1140.68548OpenAlexW2080561834MaRDI QIDQ927410
Tami Tamir, Omer Yehezkely, Hadas Shachnai
Publication date: 6 June 2008
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-007-9082-x
Related Items (11)
Improved approximation algorithms for maximum resource bin packing and lazy bin covering problems ⋮ Exactly solving packing problems with fragmentation ⋮ New formulations for variable cost and size bin packing problems with item fragmentation ⋮ A MILP model and two heuristics for the bin packing problem with conflicts and item fragmentation ⋮ A study on load-balanced variants of the bin packing problem ⋮ Approximation schemes for packing splittable items with cardinality constraints ⋮ Improved results for a memory allocation problem ⋮ An improved approximation scheme for variable-sized bin packing ⋮ Bin packing problem with conflicts and item fragmentation ⋮ The basic train makeup problem in shunting yards ⋮ Offline black and white bin packing
Cites Work
- A new polynomial-time algorithm for linear programming
- Minimizing makespan and preemption costs on a system of uniform machines
- Bin packing can be solved within 1+epsilon in linear time
- Using fast matrix multiplication to find basic solutions
- Smoothed analysis of termination of linear programming algorithms
- Complexity of fragmentable object bin packing and an application
- The many facets of linear programming
- Scheduling with Deadlines and Loss Functions
- Parallel Processor Scheduling with Limited Number of Preemptions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Approximation schemes for packing with item fragmentation
