Inverse minimum cost flow problems under the weighted Hamming distance

DOI10.1016/j.ejor.2010.03.029zbMath1205.90062MaRDI QIDQ992575

Enyu Yao, Yiwei Jiang, Biao Wu, Longcheng Liu

Publication date: 9 September 2010

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.03.029

zbMATH Keywords

inverse problem; Hamming distance; network flows; APX-hard; strongly polynomial algorithm

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B10: Deterministic network models in operations research

90C27: Combinatorial optimization

Related Items

Capacity inverse minimum cost flow problems under the weighted Hamming distance, The inverse parallel machine scheduling problem with minimum total completion time, An algorithm for solving the shortest path improvement problem on rooted trees under unit Hamming distance, On inverse linear programming problems under the bottleneck-type weighted Hamming distance, Inverse minimum flow problem under the weighted sum-type Hamming distance, Inverse generalized minimum cost flow problem under the Hamming distances, Note on ``Inverse minimum cost flow problems under the weighted Hamming distance

Cites Work

• Unnamed Item
• 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
• Constrained inverse min-max spanning tree problems under the weighted Hamming distance
• 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
• Calculating some inverse linear programming problems
• Inverse maximum flow problems under the weighted Hamming distance
• Inverse minimum spanning tree problem and reverse shortest-path problem with discrete values
• Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
• A WEIGHTED INVERSE MINIMUM CUT PROBLEM UNDER THE BOTTLENECK TYPE HAMMING DISTANCE
• Inverse Optimization