A Successive Shortest Path Algorithm for The Assignment Problem (Q4744086): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1080/03155986.1982.11731874 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1508977476 / rank | |||
Normal rank | |||
Latest revision as of 20:56, 19 March 2024
scientific article; zbMATH DE number 3799429
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
