Capacity inverse minimum cost flow problems under the weighted Hamming distance

DOI10.1007/S11590-015-0919-YMaRDI QIDQ315493zbMATH OpenOpenAlexFDO

Authors Longcheng Liu, Enyu Yao

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

APX-hardHamming distanceinverse problemminimum cost flowstrongly polynomial algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Inverse minimum cost flow problems under the weighted Hamming distance
• Inverse generalized minimum cost flow problem under the Hamming distances
• Inverse minimum flow problem under the weighted sum-type Hamming distance
• A modified algorithm for solving the inverse minimum cost flow problem under the bottleneck-type Hamming distance
• Capacity inverse minimum cost flow problem

Cites work

• Calculating some inverse linear programming problems
• Capacity inverse minimum cost flow problem
• Constrained inverse minimum spanning tree problems under the bottleneck-type Hamming distance
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Inverse maximum flow problems under the weighted Hamming distance
• Inverse minimum cost flow problems under the weighted Hamming distance
• Inverse Optimization
• Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems
• Network flows. Theory, algorithms, and applications.
• Note on ``Inverse minimum cost flow problems under the weighted Hamming distance
• On an instance of the inverse shortest paths problem
• On the approximability of the maximum common subgraph problem
• Some inverse optimization problems under the Hamming distance
• The center location improvement problem under the Hamming distance
• Weighted inverse minimum spanning tree problems under Hamming distance

Cited in

(12)

• Inverse minimum flow problem under the weighted sum-type Hamming distance
• Constrained inverse minimum flow problems under the weighted Hamming distance
• Inverse maximum flow problem under the combination of the weighted \(l_2\) norm and the weighted Hamming distance
• Capacity inverse minimum cost flow problem
• Inverse generalized minimum cost flow problem under the Hamming distances
• Inverse maximum flow problems under the weighted 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
• A modified algorithm for solving the inverse minimum cost flow problem under the bottleneck-type Hamming distance
• Reverse maximum flow problem under the weighted Chebyshev distance
• A weighted inverse minimum \(s-t\) cut problem with value constraint under the Bottleneck-type Hamming distance
• Inverse minimum cost flow problems under the weighted Hamming distance

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q315493)