Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with monge costs (Q2811304)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with monge costs |
scientific article |
Statements
Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with monge costs (English)
0 references
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
