Inverse maximum flow problem under the combination of the weighted \(l_2\) norm and the weighted Hamming distance

DOI10.1007/s40305-019-00273-wzbMath1499.90046OpenAlexW2990728891MaRDI QIDQ2240118

Yanyan Li

Publication date: 5 November 2021

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-019-00273-w

zbMATH Keywords

inverse problemminimum cutmaximum flowstrongly polynomial algorithmresidual network

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Flows in graphs (05C21)

Cites Work

• Unnamed Item
• Unnamed Item
• The inverse 1-center problem on trees with variable edge lengths under Chebyshev norm and Hamming distance
• Inverse 1-median problem on trees under weighted Hamming distance
• The inverse \(p\)-maxian problem on trees with variable edge lengths
• Inverse minimum flow problem
• Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
• Constrained inverse min-max spanning tree problems under the weighted Hamming distance
• Inverse 1-center location problems with edge length augmentation on trees
• Inverse problem of minimum cuts
• Weighted inverse minimum spanning tree problems under Hamming distance
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Capacity inverse minimum cost flow problem
• Inverse maximum flow problems under the weighted Hamming distance
• Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
• Note on ``Inverse minimum cost flow problems under the weighted Hamming distance
• A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE
• The inverse maximum flow problem consideringl_∞norm
• The inverse maximum flow problem with lower and upper bounds for the flow
• Inverse maximum flow and minimum cut problems
• Max flows in O(nm) time, or better

This page was built for publication: Inverse maximum flow problem under the combination of the weighted \(l_2\) norm and the weighted Hamming distance