Capacity inverse minimum cost flow problems under the weighted Hamming distance

DOI10.1007/S11590-015-0919-YzbMath1353.90170OpenAlexW833648316MaRDI QIDQ315493

Enyu Yao, Longcheng Liu

Publication date: 21 September 2016

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-015-0919-y

zbMATH Keywords

inverse problemHamming distanceminimum cost flowAPX-hardstrongly polynomial algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (2)

Inverse minimum flow problem under the weighted sum-type Hamming distance ⋮ Inverse generalized minimum cost flow problem under the Hamming distances

Cites Work

• Unnamed Item
• Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems
• Inverse minimum cost flow 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
• Calculating some inverse linear programming problems
• 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
• Inverse Optimization
• On the approximability of the maximum common subgraph problem

This page was built for publication: Capacity inverse minimum cost flow problems under the weighted Hamming distance