On the inverse problem of linear programming and its application to minimum weight perfect \(k\)-matching

DOI10.1016/S0377-2217(97)00444-XzbMath0937.90061OpenAlexW2001452717MaRDI QIDQ1806920

Siming Huang, Zhenhong Liu

Publication date: 8 November 1999

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00444-x

zbMATH Keywords

linear programminginverse problembipartite graphstrongly polynomial algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27)

Related Items (4)

An interior-point algorithm for solving inverse linear optimization problem ⋮ On inverse linear programming problems under the bottleneck-type weighted Hamming distance ⋮ Inverse multiobjective optimization: inferring decision criteria from data ⋮ Inverse optimization problems with multiple weight functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On an instance of the inverse shortest paths problem
• On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• Fibonacci heaps and their uses in improved network optimization algorithms

This page was built for publication: On the inverse problem of linear programming and its application to minimum weight perfect \(k\)-matching