A Successive Shortest Path Algorithm for The Assignment Problem (Q4744086)
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 Successive Shortest Path Algorithm for The Assignment Problem |
scientific article; zbMATH DE number 3799429
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Successive Shortest Path Algorithm for The Assignment Problem |
scientific article; zbMATH DE number 3799429 |
Statements
A Successive Shortest Path Algorithm for The Assignment Problem (English)
0 references
1982
0 references
comparison of algorithms
0 references
successive shortest path algorithm
0 references
sparse assignment problem
0 references
bipartite graph
0 references
relaxed problem
0 references
relaxed optimal solution
0 references
computer implementation
0 references
computational experiences
0 references
