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

DOI10.1016/j.ejor.2015.07.035zbMath1346.90713OpenAlexW1208784108MaRDI QIDQ320688

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

reliabilitycombinatorial optimizationnetworksgraph theory

Mathematics Subject Classification ID

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

Related Items (1)

Network augmentation for disaster‐resilience against geographically correlated failure

Cites Work

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

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