论文信息 - Linear and semi-assignment problems: A core oriented approach

Linear and semi-assignment problems: A core oriented approach

A Linear Assignment Problem (LAP) with a dense cost matrix can be solved by first making this matrix sparse, i.e. the problem is solved on the core of the matrix. For a known LAP algorithm we give the related modifications. Computational results show that the algorithm is then suited to solve large problems. A standard personal computer can solve problem instances up to size 2000 within about 75 seconds. Furthermore, we describe versions of the algorithm for non-square problems as well as for semi-assignment problems; computational results for problem instances up to size 2500 show again the success of the core oriented approach for assignment problems.

A. Volgenant

[1] Ulrich Derigs,et al. An in-core/out-of-core method for solving large scale assignment problems , 1986, Z. Oper. Research.

[2] Dimitri P. Bertsekas,et al. The Auction Algorithm for Assignment and Other Network Flow Problems: A Tutorial , 1990 .

[3] R. Burkard,et al. Assignment and Matching Problems: Solution Methods with FORTRAN-Programs , 1980 .

[4] Jeffery L. Kennington,et al. A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem , 1992, Oper. Res..

[5] N. Tomizawa,et al. On some techniques useful for solution of transportation network problems , 1971, Networks.

[6] George Kocur,et al. An Implementation of a Shortest Augmenting Path Algorithm for the Assignment Problem , 1991, Network Flows And Matching.

[7] Paolo Toth,et al. Primal-dual algrorithms for the assignment problem , 1987, Discret. Appl. Math..

[8] T. A. J. Nicholson,et al. Finding the Shortest Route between Two Points in a Network , 1966, Comput. J..

[9] Jeffery L. Kennington,et al. An Empirical Analysis of the Dense Assignment Problem: Sequential and Parallel Implementations , 1991, INFORMS J. Comput..