A shortest augmenting path algorithm for dense and sparse linear assignment problems (Q1085784): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:11, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A shortest augmenting path algorithm for dense and sparse linear assignment problems |
scientific article |
Statements
A shortest augmenting path algorithm for dense and sparse linear assignment problems (English)
0 references
1987
0 references
We develop a shortest augmenting path algorithm for the linear assignment problem. It contains new initialization routines and a special implementation of Dijkstra's shortest path method. For both dense and sparse problems computational experiments show this algorithm to be uniformly faster than the best algorithms from the literature. A Pascal implementation is presented.
0 references
shortest augmenting path algorithm
0 references
linear assignment
0 references
computational experiments
0 references
