Reverse maximum flow problem under the weighted Chebyshev distance
Year of publication: |
2018
|
---|---|
Authors: | Tayyebi, Javad ; Mohammadi, Abumoslem ; Kazemi, Seyyed Mohammad Reza |
Published in: |
RAIRO / Operations research. - Les Ulis : EDP Sciences, ISSN 0399-0559, ZDB-ID 1481534-5. - Vol. 52.2018, 4/5, p. 1107-1121
|
Subject: | Maximum flow problem | reverse problem | Chebyshev distance | network design | Newton method | binary search | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Ant colony optimization based binary search for efficient point pattern matching in images
Sreeja, N. K., (2015)
-
A logic-based decomposition approach for multi-period network interdiction models
Enayaty-Ahangar, Forough, (2019)
-
The coupled task scheduling problem : an improved mathematical program and a new solution algorithm
Khatami, Mostafa, (2024)
- More ...
-
Note on "Inverse minimum cost flow problems under the weighted Hamming distance"
Tayyebi, Javad, (2014)
-
Study of the University Students' Mental Health at Teacher Training University of Sabzevar
Tayyebi, Javad, (2013)
-
The continuous maximum capacity path interdiction problem
Tayyebi, Javad, (2023)
- More ...