A new method for solving the assignment problem based on the permissible-edge algorithm for the minimum cost flow problem (Q4900984)
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 method for solving the assignment problem based on the permissible-edge algorithm for the minimum cost flow problem |
scientific article; zbMATH DE number 6129452
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new method for solving the assignment problem based on the permissible-edge algorithm for the minimum cost flow problem |
scientific article; zbMATH DE number 6129452 |
Statements
24 January 2013
0 references
assignment problem
0 references
minimum cost flow problem
0 references
principle of duality
0 references
complementary slackness conditions
0 references
permissible edge algorithm
0 references
0.8384132385253906
0 references
0.796340823173523
0 references
0.7810577154159546
0 references
0.7794245481491089
0 references
