Upgrading edge-disjoint paths in a ring

DOI10.1016/J.DISOPT.2010.08.002zbMath1241.90166OpenAlexW2042589589MaRDI QIDQ429680

Jácint Szabó

Publication date: 20 June 2012

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2010.08.002

zbMATH Keywords

multicommodity flowsring routing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Unnamed Item
• Edge-disjoint paths in planar graphs
• On the Complexity of Timetable and Multicommodity Flow Problems
• The Ring Loading Problem
• A cycle augmentation algorithm for minimum cost multicommodity flows on a ring

This page was built for publication: Upgrading edge-disjoint paths in a ring