A shortest augmenting path algorithm for dense and sparse linear assignment problems (Q60468438)
Jump to navigation
Jump to search
No description defined
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A shortest augmenting path algorithm for dense and sparse linear assignment problems |
No description defined |
Statements
A shortest augmenting path algorithm for dense and sparse linear assignment problems (English)
0 references
December 1987
0 references
38
0 references
4
0 references
325-340
0 references
Identifiers
1 reference
28 January 2021