The bin packing problem with item fragmentation: a worst-case analysis

DOI10.1016/J.DAM.2018.08.023zbMath1420.90057OpenAlexW2898509653WikidataQ129046486 ScholiaQ129046486MaRDI QIDQ2414454

Luca Bertazzi, Xingyin Wang, Bruce L. Golden

Publication date: 17 May 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.08.023

zbMATH Keywords

bin packing problemworst-case analysissplit delivery vehicle routing problemitem fragmentation

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)

Related Items (5)

EPTAS for the dual of splittable bin packing with cardinality constraint ⋮ Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem ⋮ Bin packing problem with conflicts and item fragmentation ⋮ Direct \(k\)-routing versus cross-docking: worst-case results ⋮ Algorithms for the bin packing problem with scenarios

Cites Work

• Unnamed Item
• Unnamed Item
• Mathematical programming algorithms for bin packing problems with item fragmentation
• Exactly solving packing problems with fragmentation
• A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts
• Lower and upper bounds for the bin packing problem with fragile objects
• The stochastic generalized bin packing problem
• Complexity of fragmentable object bin packing and an application
• Two-dimensional packing problems: a survey
• Approximation schemes for packing splittable items with cardinality constraints
• Split delivery routing
• Bounds and Heuristics for Capacitated Routing Problems
• Savings by Split Delivery Routing
• Vehicle routing problems with split deliveries
• Approximation and Online Algorithms

This page was built for publication: The bin packing problem with item fragmentation: a worst-case analysis