Fractional routing using pairs of failure-disjoint paths

DOI10.1016/j.dam.2011.12.019zbMath1326.90011OpenAlexW2052407884MaRDI QIDQ496701

Walid Ben-Ameur, Mateusz Żotkiewicz, Michał Pióro

Publication date: 22 September 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2011.12.019

zbMATH Keywords

column generationshortest pathsdisjoint pathscapacitated network designcompact formulations

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25)

Uses Software

• SNDlib
• CPLEX

Cites Work

• A factor 2 approximation algorithm for the generalized Steiner network problem
• On multiroute maximum flows in networks
• On the minimum cost multiple-source unsplittable flow problem
• Emergence of Scaling in Random Networks
• A quick method for finding shortest pairs of disjoint paths
• Design of Survivable Networks: A survey
• Linear approximations in a dynamic programming approach for the uncapacitated single-source minimum concave cost network flow problem in acyclic networks.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fractional routing using pairs of failure-disjoint paths