A new polynomial-time implementation of the out-of-kilter algorithm using Minty's lemma (Q5501017)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new polynomial-time implementation of the out-of-kilter algorithm using Minty's lemma |
scientific article; zbMATH DE number 6472031
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new polynomial-time implementation of the out-of-kilter algorithm using Minty's lemma |
scientific article; zbMATH DE number 6472031 |
Statements
10 August 2015
0 references
network flows
0 references
the minimum cost flow problem
0 references
out-of-kilter algorithm
0 references
Minty's lemma
0 references
0.8718777298927307
0 references
0.8396756052970886
0 references
0.7826185822486877
0 references
0.7760687470436096
0 references
0.7758058309555054
0 references
