Improved max-flow min-cut algorithms in a circular disk failure model with application to a road network
Year of publication: |
2016
|
---|---|
Authors: | Otsuki, Kensuke ; Kobayashi, Yusuke ; Murota, Kazuo |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 248.2016, 2 (16.1.), p. 396-403
|
Subject: | Combinatorial optimization | Networks | Reliability | Graph theory | Graphentheorie | Algorithmus | Algorithm | Unternehmensnetzwerk | Business network | Mathematische Optimierung | Mathematical programming | Netzwerk | Network |
-
Models and algorithms for network reduction
Li, Gang, (2015)
-
Computing optimal shortcuts for networks
Garijo, Delia, (2019)
-
A network simplex algorithm for the equal flow problem on a generalized network
Morrison, David Robert, (2013)
- More ...
-
A Price Is a Signal: on Intrinsic Motivation, Crowding-out, and Crowding-in
Iwata, Satoru, (2010)
-
The complexity of minimizing the difference of two M⇋-convex set functions
Kobayashi, Yusuke, (2015)
-
Two disjoint shortest paths problem with non-negative edge length
Kobayashi, Yusuke, (2019)
- More ...