An algorithm for node-capacitated ring routing

DOI10.1016/j.orl.2006.03.015zbMath1180.90033OpenAlexW2072704702MaRDI QIDQ2467482

András Frank, Balázs Kotnyek, Zoltán Király

Publication date: 21 January 2008

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2006.03.015

zbMATH Keywords

multicommodity flowFourier-Motzkin elimination

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)

Related Items (3)

Network design with a discrete set of traffic matrices ⋮ A node-capacitated Okamura-Seymour theorem ⋮ Multicuts and integral multiflows in rings

Cites Work

• Unnamed Item
• Edge-disjoint paths in planar graphs
• Multicommodity flows in planar graphs
• A linear-time algorithm for edge-disjoint paths in planar graphs
• The Ring Loading Problem
• Node-Capacitated Ring Routing

This page was built for publication: An algorithm for node-capacitated ring routing