Reverse maximum flow problem under the weighted Chebyshev distance

DOI10.1051/ro/2017088zbMath1411.90346OpenAlexW2773395989MaRDI QIDQ4634311

Javad Tayyebi, Abumoslem Mohammadi, Seyyed Mohammad Reza Kazemi

Publication date: 7 May 2019

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2017088

zbMATH Keywords

Newton methodnetwork designbinary searchmaximum flow problemChebyshev distancereverse problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Flows in graphs (05C21)

Related Items

Expanding maximum capacity path under weighted sum-type distances ⋮ Optimal algorithms for inverse obnoxious center location problems under the weighted Chebyshev and Hamming cost norms on networks ⋮ Further Study on Reverse 1-Center Problem on Trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On an instance of the inverse shortest paths problem
• On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
• Some reverse location problems
• On inverse linear programming problems under the bottleneck-type weighted Hamming distance
• Computation of the reverse shortest-path problem
• Inverse combinatorial optimization: a survey on problems, methods, and results
• The shortest path improvement problems under Hamming distance
• Inverse maximum flow problems under the weighted Hamming distance
• Some inverse optimization problems under the Hamming distance
• Complexity of some inverse shortest path lengths problems
• Maximal Flow Through a Network
• The inverse maximum flow problem consideringl_∞norm
• Inverse Optimization
• The inverse maximum flow problem with lower and upper bounds for the flow
• Inverse maximum flow and minimum cut problems
• Combinatorial algorithms for inverse network flow problems
• Efficient algorithms for the reverse shortest path problem on trees under the hamming distance
• Inverse Maximum Flow Problems under the Combining Norms