Linear and semi-assignment problems: A core oriented approach

Computers and Operations Research

Volumn 23, Issue 10, 1996, Pages 917-932

  Volgenant, A ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; MATRIX ALGEBRA; PERSONAL COMPUTERS; SPECIFICATIONS;

LINEAR ASSIGNMENT;

LINEAR PROGRAMMING;

EID: 0030269645     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/0305-0548(96)00010-X     Document Type: Article

References (12)

1. N. Tomizawa,On some techniques useful for the solution of transportation problems. Networks 1,173-194 (1971).
2. U. Derigs and A. Metz,An in-core/out-of-core method for solving large scale assignment problems. Zeitschrift für Operations Research 30,181-195 (1986).
3. G. Carpaneto and P. Toth,Primal-dual algorithms for the assignment problem. Discrete Appl. Math. 18,137-153 (1987).
4. R. Jonker and A. Volgenant,A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing 38,325-340 (1987).
5. J. Kennington and Z. Wang,A shortest augmenting path algorithm for the semi-assignment problem. Opns Res. 40, 178-187 (1992).
6. T. Nicholson,Finding the shortest route between two points in a network. The Computer Journal 9,275-280 (1966).
7. F. Brouwer,The linear assignment problem: simulation of a multiprocessor algorithm (in dutch). Master Thesis, University of Amsterdam,Institute of Actuarial Sciences and Econometrics (1988).
8. J. Kennington and Z. Wang,An empirical analysis of the dense assignment problem: sequential and parallel implementations. ORSA J. Computing 3,299-306 (1991).
9. D. P. Bertsekas. The auction algorithm for assignment and other network flow problems: a tutorial. Interfaces 20, 133-149 (1990).
10. J. Hao and G. Kocur,An implementation of a shortest augmenting path algorithm for the assignment problem. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 12,453-468 (1993).
11. J. Kennington and Z. Wang,Solving dense assignment problems on a shared memory multiprocessor. Department of Computer Science & Engineering,School of Engineering and Applied Science,Southern Methodist University,Dallas, Texas (1988).
12. R. E. Burkard and U. Derigs,Assignment and Matching Problems: Solution Methods with Fortran Programs. Springer, Berlin,Heidelberg,New York. 1-11 (1980).