On inverse linear programming problems under the bottleneck-type weighted Hamming distance

DOI10.1016/j.dam.2015.12.017zbMath1396.90044OpenAlexW2295661588MaRDI QIDQ1707916

Javad Tayyebi, Massoud Aman

Publication date: 4 April 2018

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

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

zbMATH Keywords

inverse problemHamming distancenetwork flowsbinary searchstrongly polynomial algorithm

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items

The inverse connected \(p\)-median problem on block graphs under various cost functions, Expanding maximum capacity path under weighted sum-type distances, Reverse maximum flow problem under the weighted Chebyshev distance, Maximum Capacity Path Interdiction Problem with Fixed Costs, Constrained inverse minimum flow problems under the weighted Hamming distance, Inverse generalized minimum cost flow problem under the Hamming distances, Efficient algorithms for the reverse shortest path problem on trees under the hamming distance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
• Weighted inverse minimum spanning tree problems under Hamming distance
• On the inverse problem of linear programming and its application to minimum weight perfect \(k\)-matching
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Calculating some inverse linear programming problems
• Weighted inverse maximum perfect matching problems under the Hamming distance
• Capacity inverse minimum cost flow problem
• The shortest path improvement problems under Hamming distance
• 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
• Combinatorial algorithms for inverse network flow problems