Approximation algorithms for the ring loading problem with penalty cost

DOI10.1016/J.IPL.2013.08.004MaRDI QIDQ2350601zbMATH OpenOpenAlexFDO

Authors Weidong Li, Jianping Li, Li Guan

Publication date 25 June 2015

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2013.08.004

zbMATH Keywords

approximation algorithmspenalty costring loading

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Recommendations

• The directed ring loading with penalty cost
• On the ring loading problem with demand splitting.
• The weighted link ring loading problem
• Efficient algorithms for the ring loading problem with demand splitting
• An improved upper bound for the ring loading problem

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1303573 (Why is no real title available?)
• scientific article; zbMATH DE number 7051239 (Why is no real title available?)
• A constant factor approximation algorithm for unsplittable flow on paths
• A quasi-PTAS for unsplittable flow on line graphs
• Admission Control to Minimize Rejections
• Admission control to minimize rejections and online set cover with repetitions
• An efficient algorithm for the ring loading problem with integer demand splitting
• An improved approximation algorithm for \textsc{Resource Allocation}
• Call control in rings
• Call control with \(k\) rejections
• Combining online algorithms for acceptance and rejection
• Linear time algorithms for the ring loading problem with demand splitting
• Optimal online ring routing
• The Ring Loading Problem

Cited in

(5)

• A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting
• A decomposition algorithm for the ring spur assignment problem
• The directed ring loading with penalty cost
• Approximation algorithms for the multiprocessor scheduling with submodular penalties
• Online mixed ring covering problem with two nodes

This page was built for publication: Approximation algorithms for the ring loading problem with penalty cost

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2350601)