Primal-dual algrorithms for the assignment problem

Discrete Applied Mathematics

Volumn 18, Issue 2, 1987, Pages 137-153

  Carpaneto, Giorgio ^a   Toth, Paolo ^a  

^a UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Assignment problem; complete and sparse matrices; primal dual algorithms

Indexed keywords

MATHEMATICAL PROGRAMMING, LINEAR; OPTIMIZATION;

COMBINATORIAL OPTIMIZATION; HUNGARIAN METHOD; MIN-SUM LINEAR ASSIGNMENT PROBLEM; PRIMAL-DUAL ALGORITHMS; SHORTEST AUGMENTING PATH METHOD;

COMPUTER PROGRAMMING;

EID: 0022153170     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(87)90016-3     Document Type: Article

References (16)

1. The alternating basis algorithm for assignment problems
2. A new algorithm for the assignment problem
3. Algorithm 548 Solution of the assignment problem
4. Un algoritmo primale-duale per il problema dell'assegnamento lineare per matrici complete
5. Algorithm for the solution of the assignment problem for sparse matrices
6. Il Problema dell'Assegnamento: metodi ed algoritmi
7. Theoretical improvements in algoritmic efficiency of network flow problems
8. The Hungarian method for the assignment problem
9. Variants of the Hungarian method for the assignment problem
10. A hard assignment problem
11. Errata to ‘A hard assignment problem’
12. Implementation and testing of a primal-dual algorithm for the assignment problem
13. On some techniques useful for solution of transportation network problems