A Note on the Ring Loading Problem

DOI10.1137/14099588XzbMath1382.90023arXiv1405.0789MaRDI QIDQ2790401

No author found.

Publication date: 4 March 2016

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1405.0789

zbMATH Keywords

load balancingunsplittable flowSONET ring

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Flows in graphs (05C21)

Related Items (2)

An Improved Upper Bound for the Ring Loading Problem ⋮ Online mixed ring covering problem with two nodes

Cites Work

• Edge-disjoint paths in planar graphs
• On the single-source unsplittable flow problem
• Multicommodity flows in planar graphs
• Algorithms for routing around a rectangle
• Approximating the single source unsplittable min-cost flow problem
• The analysis of evolutionary algorithms -- A proof that crossover really can help
• Single-Sink Multicommodity Flow with Side Constraints
• Convex Combinations of Single Source Unsplittable Flows
• Optimal Load Balancing on Sonet Bidirectional Rings
• The Ring Loading Problem
• The Ring Loading Problem

This page was built for publication: A Note on the Ring Loading Problem