Improved max-flow min-cut algorithms in a circular disk failure model with application to a road network

DOI10.1016/J.EJOR.2015.07.035MaRDI QIDQ320688zbMATH OpenOpenAlexFDO

Authors Kensuke Otsuki, Yusuke Kobayashi, Kazuo Murota

Publication date 7 October 2016

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2015.07.035

zbMATH Keywords

combinatorial optimizationgraph theorynetworksreliability

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Reliability, availability, maintenance, inspection in operations research (90B25) Combinatorial optimization (90C27)

Recommendations

• An algorithm of calculating the reliability of stochastic flow networks by using minimal cuts
• Parametric multiroute flow and its application to robust network with \(k\) edge failures
• scientific article; zbMATH DE number 5812721
• Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
• Improved bounds on the max-flow min-cut ratio for multicommodity flows
• scientific article; zbMATH DE number 2186021
• Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation
• Reliability evaluation of a limited-flow network in terms of minimal cutsets

Cites work

• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Maximal Flow Through a Network
• Some Generalized Max-Flow Min-Cut Problems in the Plane

Cited in

(3)

• The Earth is nearly flat: Precise and approximate algorithms for detecting vulnerable regions of networks in the plane and on the sphere
• Network augmentation for disaster‐resilience against geographically correlated failure
• An algorithm for the estimation of minimal cut and path sets from field failure data

This page was built for publication: Improved max-flow min-cut algorithms in a circular disk failure model with application to a road network

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