Multicommodity Flows in Ring Networks

DOI10.1287/ijoc.8.3.235zbMath0863.90062OpenAlexW1991039238MaRDI QIDQ5690263

Alexander Shulman, Peter Kubat, Rita Vachani, Julie A. Ward

Publication date: 11 February 1997

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.8.3.235

zbMATH Keywords

multicommodity flowsring network

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (12)

Sonet ring sizing with genetic algorithms ⋮ An Improved Upper Bound for the Ring Loading Problem ⋮ Computing minimal solutions to the ring loading problem ⋮ Regenerator Location Problem in Flexible Optical Networks ⋮ On the ring loading problem with demand splitting. ⋮ Exact solution of the SONET ring loading problem ⋮ Network design with a discrete set of traffic matrices ⋮ Integral polyhedra related to integer multicommodity flows on a cycle ⋮ Minimal multicut and maximal integer multiflow: a survey ⋮ A compact formulation of the ring loading problem with integer demand splitting ⋮ Multicuts and integral multiflows in rings ⋮ Design of partially survivable networks for cellular telecommunication systems

This page was built for publication: Multicommodity Flows in Ring Networks