On the inverse problem of linear programming and its application to minimum weight perfect \(k\)-matching
type: Item
instance of: scholarly article
title: On the inverse problem of linear programming and its application to minimum weight perfect \(k\)-matching
zbMATH Open document ID: 0937.90061
DOI: 10.1016/S0377-2217(97)00444-X
author: Siming Huang
author: Zhenhong Liu
published in: European Journal of Operational Research
publication date: 1999-11-08T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1358477
zbMATH Keywords: linear programming
zbMATH Keywords: inverse problem
zbMATH Keywords: bipartite graph
zbMATH Keywords: strongly polynomial algorithm
MaRDI profile type: Publication
cites work: On an instance of the inverse shortest paths problem
cites work: On the use of an inverse shortest paths algorithm for recovering linearly correlated costs
cites work: Q4363164
cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
cites work: Q3056948
cites work: Fibonacci heaps and their uses in improved network optimization algorithms
cites work: Q5519711
full work available at URL: s0377-2217(97)00444-x
OpenAlex ID: W2001452717
description: scientific article; zbMATH DE number 1358477