The inverse maximum flow problem consideringl∞norm

DOI10.1051/ro:2008017zbMath1210.90138OpenAlexW2111846710MaRDI QIDQ3598045

Adrian Deaconu

Publication date: 29 January 2009

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

Full work available at URL: https://eudml.org/doc/105410

zbMATH Keywords

maximum flowinverse combinatorial optimizationstrongly polynomial time complexity

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27)

Related Items

The inverse maximum dynamic flow problem ⋮ Reverse maximum flow problem under the weighted Chebyshev distance ⋮ Inverse maximum flow problem under the combination of the weighted \(l_2\) norm and the weighted Hamming distance ⋮ The minmax regret inverse maximum weight problem ⋮ Inverse minimum flow problem under the weighted sum-type Hamming distance ⋮ Constrained inverse minimum flow problems under the weighted Hamming distance ⋮ Inverse feasibility problems of the inverse maximum flow problems

Cites Work

• Unnamed Item
• Unnamed Item
• An inverse maximum capacity path problem with lower bound constraints
• Inverse minimum flow problem
• Inverse problem of minimum cuts
• Sequential and parallel algorithms for minimum flows.
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Inverse maximum flow problems under the weighted Hamming distance
• Solving Inverse Spanning Tree Problems Through Network Flow Techniques
• 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