Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with Monge costs (Q2811304)
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: Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with Monge costs |
scientific article; zbMATH DE number 6591786
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with Monge costs |
scientific article; zbMATH DE number 6591786 |
Statements
10 June 2016
0 references
Monge matrix
0 references
transportation problem
0 references
assignment problem
0 references
networks flow algorithms
0 references
computational complexity
0 references
minimum cost flow problem
0 references
0 references
0.8989878
0 references
0.88162893
0 references
0.8713273
0 references
0.86915183
0 references
0.8664111
0 references
0.8620017
0 references
0.8594117
0 references
0.8566038
0 references
Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with Monge costs (English)
0 references
