On the inverse problem of linear programming and its application to minimum weight perfect \(k\)-matching (Q1806920)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1358477
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the inverse problem of linear programming and its application to minimum weight perfect \(k\)-matching |
scientific article; zbMATH DE number 1358477 |
Statements
On the inverse problem of linear programming and its application to minimum weight perfect \(k\)-matching (English)
0 references
8 November 1999
0 references
linear programming
0 references
inverse problem
0 references
bipartite graph
0 references
strongly polynomial algorithm
0 references
0 references
0.8779172301292419
0 references
0.829936683177948
0 references
0.8189995288848877
0 references
0.8058785200119019
0 references
