A shortest augmenting path algorithm for dense and sparse linear assignment problems (Q1085784): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Created claim: Wikidata QID (P12): Q60468438, #quickstatements; #temporary_batch_1706814575051 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q60468438 / rank | |||
Normal rank | |||
Revision as of 21:23, 1 February 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
