Upgrading edge-disjoint paths in a ring

DOI10.1016/J.DISOPT.2010.08.002zbMATH Open1241.90166OpenAlexW2042589589MaRDI QIDQ429680FDOQ429680

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

Recommendations

• scientific article
• Upgrading Shortest Paths in Networks
• Network upgrading problems
• scientific article; zbMATH DE number 2086258
• scientific article; zbMATH DE number 1859293

zbMATH Keywords

multicommodity flowsring routing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• On the Complexity of Timetable and Multicommodity Flow Problems
• Edge-disjoint paths in planar graphs
• Title not available (Why is that?)
• The Ring Loading Problem
• A cycle augmentation algorithm for minimum cost multicommodity flows on a ring

Cited In (1)

• Title not available (Why is that?)

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

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