Approximation of the \(k\)-batch consolidation problem

DOI10.1016/J.TCS.2008.11.007zbMath1162.90008OpenAlexW1993455448MaRDI QIDQ1006079

Soo Y. Chang, Sung-Pil Hong, Myoung-Ju Park

Publication date: 17 March 2009

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

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

zbMATH Keywords

approximation algorithminapproximability\(k\)-batch consolidation problem\(k\)-set cover problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Approximation algorithms (68W25)

Related Items (2)

Order consolidation for hierarchical product lines ⋮ Approximation of a batch consolidation problem

Cites Work

• Unnamed Item
• Complexity of approximating bounded variants of optimization problems
• Approximation of a batch consolidation problem
• On the hardness of approximating minimization problems
• An approximation scheme for bin packing with conflicts
• Approximation Schemes for Packing Splittable Items with Cardinality Constraints
• On Bin Packing with Conflicts
• Approximating the Unweighted k-Set Cover Problem: Greedy Meets Local Search

This page was built for publication: Approximation of the \(k\)-batch consolidation problem