A negative dual rectangle cancellation algorithm for the linear assignment problem

In this paper, we consider three alternative primal models and their corresponding alternative dual models for the linear assignment problem. We then define the concept of Negative Dual Rectangle (NDR) and suggest an algorithm that solves two of these dual problems by repeatedly finding and cancelling NDRs until it yields an optimal solution to the assignment problem. The algorithm is simple, flexible, efficient, and unified. We also introduce the notion of partial zero cover as an interpretation of an NDR. We then introduce some heuristic methods for finding NDRs. We also state and prove a lemma to establish the optimal use of an NDR. Furthermore, we show that on a new class of benchmark instances that is introduced in this paper the running time of our algorithm is highly superior to a well-known pure shortest path algorithm.

[1]  Andrew V. Goldberg,et al.  An efficient cost scaling algorithm for the assignment problem , 1995, Math. Program..

[2]  P. V. Remoortere Linear and combinatorial programming : K.G. Murty: 1976,J. Wiley, New York, 310 pp , 1979 .

[3]  Samuel J. Raff,et al.  Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..

[4]  P. M. Pardalos,et al.  Nonlinear Assignment Problems: Algorithms and Applications (Combinatorial Optimization) , 2000 .

[5]  Paolo Toth,et al.  Algorithms and codes for dense assignment problems: the state of the art , 2000, Discret. Appl. Math..

[6]  Jitendra Malik,et al.  Shape matching and object recognition using shape contexts , 2010, 2010 3rd International Conference on Computer Science and Information Technology.

[7]  Rainer E. Burkard Time-slot assignment for TDMA-systems , 2005, Computing.

[8]  Mauro Dell'Amico,et al.  Annotated Bibliographies in Combinatorial Optimization , 1997 .

[9]  H. Kuhn The Hungarian method for the assignment problem , 1955 .

[10]  Panos M. Pardalos,et al.  On the expected optimal value of random assignment problems: Experimental results and open questions , 1993, Comput. Optim. Appl..

[11]  Rainer E. Burkard,et al.  Selected topics on assignment problems , 2002, Discret. Appl. Math..

[12]  Richard M. Karp,et al.  Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane , 1977, Math. Oper. Res..

[13]  Lars Relund Nielsen,et al.  An algorithm for ranking assignments using reoptimization , 2008, Comput. Oper. Res..

[14]  Panos M. Pardalos,et al.  Asymptotic behavior of the expected optimal value of the multidimensional assignment problem , 2007, Math. Program..

[15]  A. Volgenant,et al.  A shortest augmenting path algorithm for dense and sparse linear assignment problems , 1987, Computing.

[16]  K. G. Ramakrishnan,et al.  An Approximate Dual Projective Algorithm for Solving Assignment Problems , 1991, Network Flows And Matching.

[17]  S. Thrun,et al.  Monte carlo em for data-association and its applications in computer vision , 2001 .

[18]  Aubrey B. Poore,et al.  Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking , 1994, Comput. Optim. Appl..

[19]  Bruno Simeone Fortran codes for network optimization , 1988 .

[20]  David W. Pentico,et al.  Assignment problems: A golden anniversary survey , 2007, Eur. J. Oper. Res..

[21]  Mauro Dell'Amico,et al.  Assignment Problems , 1998, IFIP Congress: Fundamentals - Foundations of Computer Science.

[22]  Rainer E. Burkard,et al.  Linear Assignment Problems and Extensions , 1999, Handbook of Combinatorial Optimization.

[23]  W. Brogan Algorithm for Ranked Assignments with Applications to Multiobject Tracking , 1989 .