.png){kind=icon}
.png){kind=icon}
Return
A negative dual rectangle cancellation algorithm for the linear assignment problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2013.05.013.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2013 Elsevier Ltd. All rights reserved.
Keywords:
Assignment problem
Hungarian method
Integer programming
Negative dual rectangle
Partial zero cover
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W