Multicommodity Flows in Ring Networks

DOI10.1287/IJOC.8.3.235MaRDI QIDQ5690263zbMATH OpenOpenAlexFDO

Authors Rita Vachani, Alexander Shulman, Peter Kubat, 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)

Recommendations

• Multicommodity flows in simple multistage networks
• Multicommodity flows in tree-like networks
• Multicommodity flows in certain planar directed networks
• Multicommodity flows in cycle graphs
• A multi-commodity flow based model for multi layer hierarchical ring network design
• scientific article; zbMATH DE number 3947966
• Multicommodity flows on road networks
• The non-complementarity of equilibrium routings of ring networks

Cited in

(25)

• 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
• Sonet ring sizing with genetic algorithms
• Computation of a redundant ring in a hierarchical communication system
• Combinatorial design of multi-ring networks with combined routing and flow control.
• Designing tributary networks with multiple ring families.
• On the ring loading problem with demand splitting.
• Exact solution of the SONET ring loading problem
• Heterogeneous multi-commodity network flows over time
• Network design with a discrete set of traffic matrices
• Multicommodity flows in cycle graphs
• scientific article; zbMATH DE number 997811 (Why is no real title available?)
• Product Multicommodity Flow in Wireless Networks
• Regenerator location problem in flexible optical networks
• Multicommodity flows in simple multistage networks
• scientific article; zbMATH DE number 949034 (Why is no real title available?)
• An improved upper bound for the ring loading problem
• Node-Capacitated Ring Routing
• A cycle augmentation algorithm for minimum cost multicommodity flows on a ring
• On describing the routing capacity regions of networks
• Computing minimal solutions to the ring loading problem
• Minimal multicut and maximal integer multiflow: a survey
• Multicommodity flows in tree-like networks
• Integral polyhedra related to integer multicommodity flows on a cycle

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

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