Inverse minimum flow problem under the weighted sum-type Hamming distance

DOI10.1016/j.dam.2017.06.002zbMath1367.05093OpenAlexW2727477347MaRDI QIDQ2012059

Yanyan Li

Publication date: 27 July 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2017.06.002

zbMATH Keywords

inverse problemminimum cutHamming distancestrongly polynomial algorithmminimum flow

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Distance in graphs (05C12) Mathematical programming (90C99) Flows in graphs (05C21)

Related Items (1)

Constrained inverse minimum flow problems under the weighted Hamming distance

Cites Work

• Unnamed Item
• Capacity inverse minimum cost flow problems under the weighted Hamming distance
• 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
• Inverse minimum flow problem
• Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems
• Inverse min-max spanning tree problem under the weighted sum-type Hamming distance
• Inverse minimum cost flow problems under the weighted Hamming distance
• Constrained inverse min-max spanning tree problems under the weighted Hamming distance
• On an instance of the inverse shortest paths problem
• Weighted inverse minimum spanning tree problems under Hamming distance
• The center location improvement problem under the Hamming distance
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Weighted inverse maximum perfect matching problems under the Hamming distance
• 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
• Some inverse optimization problems under the 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
• Combinatorial algorithms for inverse network flow problems
• Max flows in O(nm) time, or better

This page was built for publication: Inverse minimum flow problem under the weighted sum-type Hamming distance