Online mixed ring covering problem with two nodes

DOI10.1007/S43069-022-00189-XOpenAlexW4313509702MaRDI QIDQ2677362

Xiaofei Liu, Weidong Li, Man Xiao

Publication date: 13 January 2023

Published in: SN Operations Research Forum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s43069-022-00189-x

zbMATH Keywords

competitive ratioonline algorithmbuffermixed ringring covering

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• The weighted link ring loading problem
• A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting
• On the ring loading problem with demand splitting.
• Semi-online hierarchical scheduling for \(l_p\)-norm load balancing with buffer or rearrangements
• Approximation algorithms for routing and call scheduling in all-optical chains and rings.
• Exact solution of the SONET ring loading problem
• A primal-dual approximation algorithm for the \(k\)-prize-collecting minimum power cover problem
• An improved upper bound for the Ring Loading Problem
• A primal-dual algorithm for the minimum partial set multi-cover problem
• Approximation algorithms for the ring loading problem with penalty cost
• A Note on the Ring Loading Problem
• Optimal online ring routing
• Optimal Load Balancing on Sonet Bidirectional Rings
• The Ring Loading Problem
• Linear time algorithms for the ring loading problem with demand splitting
• The Ring Loading Problem
• The Directed Ring Loading with Penalty Cost
• Makespan minimization in online scheduling with machine eligibility

This page was built for publication: Online mixed ring covering problem with two nodes