Reverse maximum flow problem under the weighted Chebyshev distance
RAIRO-Oper. Res., 52 4-5 (2018) 1107-1121
Published online: 2018-11-22
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks
Mehran Hasanzadeh, Behrooz Alizadeh and Fahimeh BaroughiOptimization 73 (3) 545 (2024)
https://doi.org/10.1080/02331934.2022.2116937
An intelligent node labelling maximum flow algorithm
Trust Tawanda, Philimon Nyamugure, Santosh Kumar and Elias MunapoInternational Journal of System Assurance Engineering and Management 14 (4) 1276 (2023)
https://doi.org/10.1007/s13198-023-01930-3
Expanding maximum capacity path under weighted sum-type distances
Javad Tayyebi and Adrian DeaconuAIMS Mathematics 6 (4) 3996 (2021)
https://doi.org/10.3934/math.2021237
Flow Increment through Network Expansion
Adrian Marius Deaconu and Luciana MajercsikMathematics 9 (18) 2308 (2021)
https://doi.org/10.3390/math9182308
Further Study on Reverse 1-Center Problem on Trees
Ali Reza Sepasian and Javad TayyebiAsia-Pacific Journal of Operational Research 37 (06) 2050034 (2020)
https://doi.org/10.1142/S0217595920500347
Inverse Minimum Cut Problem with Lower and Upper Bounds
Adrian Deaconu and Laura CiupalaMathematics 8 (9) 1494 (2020)
https://doi.org/10.3390/math8091494
Inverse Generalized Maximum Flow Problems
Javad Tayyebi and Adrian DeaconuMathematics 7 (10) 899 (2019)
https://doi.org/10.3390/math7100899