论文信息 - An Approximate Dual Projective Algorithm for Solving Assignment Problems

An Approximate Dual Projective Algorithm for Solving Assignment Problems

This paper discusses a new algorithm for solving the assignment problem. This algorithm, called the Approximate Dual Projective algorithm for assignment (ADP/A), is a variant of the Karmarkar interior point algorithm for LPs, specialized to solve the assignment problem. Computational results are reported on various classes of assignment problems. These results indicate that this method, holds promise for solving large assignment problems.

K. G. Ramakrishnan | Narendra Karmarkar | Anil P. Kamath | N. Karmarkar | A. Kamath

[1] David A. Castañón,et al. Reverse Auction Algorithms for Assignment Problems , 1991, Network Flows And Matching.

[2] Darwin Klingman,et al. NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .

[3] R. V. Helgason,et al. Algorithms for network programming , 1980 .

[4] K. G. Ramakrishnan,et al. Computational results of an interior point algorithm for large scale linear programming , 1991, Math. Program..

[5] D. Bayer,et al. The Non-Linear Geometry of Linear Pro-gramming I: A?ne and projective scaling trajectories , 1989 .

[6] Dimitri P. Bertsekas,et al. The Auction Algorithm for Assignment and Other Network Flow Problems , 1991 .

[7] Dimitri P. Bertsekas,et al. Linear network optimization - algorithms and codes , 1991 .

[8] Michael J. Todd. A Low Complexity Interior-Point Algorithm for Linear Programming , 1992, SIAM J. Optim..

[9] Wu Shiquan,et al. New algorithms for linear programming , 1992 .

[10] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..

[11] Clóvis C. Gonzaga,et al. Polynomial affine algorithms for linear programming , 1990, Math. Program..