Node-Capacitated Ring Routing

DOI10.1287/MOOR.27.2.372.323MaRDI QIDQ5704085zbMATH OpenOpenAlexWikidataFDO

Authors András Frank, Bruce Shepherd, Vivek Tandon, Zoltán Végh

Publication date 11 November 2005

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.27.2.372.323

zbMATH Keywords

multicommodity flowring routinghalf-integral flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Recommendations

• Multicommodity Flows in Ring Networks
• Multicuts and integral multiflows in rings
• A cycle augmentation algorithm for minimum cost multicommodity flows on a ring
• On describing the routing capacity regions of networks
• The Ring Loading Problem

Cited in

(5)

• A cycle augmentation algorithm for minimum cost multicommodity flows on a ring
• Multicuts and integral multiflows in rings
• Network design with a discrete set of traffic matrices
• An algorithm for node-capacitated ring routing
• On describing the routing capacity regions of networks

This page was built for publication: Node-Capacitated Ring Routing

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