Bin packing with fragmentable items: presentation and approximations

DOI10.1016/j.tcs.2015.08.005zbMath1330.90095OpenAlexW2473024743MaRDI QIDQ497678

Bertrand LeCun, Thierry Mautor, Franck Quessette, Marc-Antoine Weisser

Publication date: 25 September 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.08.005

zbMATH Keywords

combinatorial optimizationapproximation algorithmbin-packing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (4)

Exactly solving packing problems with fragmentation ⋮ New formulations for variable cost and size bin packing problems with item fragmentation ⋮ Column generation for the variable cost and size bin packing problem with fragmentation ⋮ Bin packing problem with conflicts and item fragmentation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximum bounded 3-dimensional matching is MAX SNP-complete
• Complexity of fragmentable object bin packing and an application
• A typology of cutting and packing problems
• On the complexity of approximating \(k\)-set packing
• Scheduling with Deadlines and Loss Functions
• On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
• Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms

This page was built for publication: Bin packing with fragmentable items: presentation and approximations