Abstract
The rectangular assignment problem is a generalization of the linear assignment problem (LAP): one wants to assign a number of persons to a smaller number of jobs, minimizing the total corresponding costs. Applications are, e.g., in the fields of object recognition and scheduling. Further, we show how it can be used to solve variants of the LAP, such as the k-cardinality LAP and the LAP with outsourcing by transformation. We introduce a transformation to solve the machine replacement LAP.
We describe improvements of a LAP-algorithm for the rectangular problem, in general and slightly adapted for these variants, based on the structure of the corresponding cost matrices. For these problem instances, we compared the best special codes from literature to our codes, which are more general and easier to implement. The improvements lead to more efficient and robust codes, making them competitive on all problem instances and often showing much shorter computing times.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Bertsekas, D. P., & Castañon, D. A. (1992). A forward reverse auction algorithm for asymmetric assignment problems. Computational Optimization and Applications, 1, 277–297.
Bertsekas, D. P., Castañon, D. A., & Tsaknakis, H. (1993). Reverse auction and the solution of asymmetric assignment problems. SIAM Journal on Optimization, 3, 268–299.
Burkard, R., Dell’Amico, M., & Martello, S. (2009). Assignment Problems. Philadelphia: Society for Industrial and Applied Mathematics.
Caseau, Y., & Laburthe, F. (2000). Solving weighted matching problems with constraints. Constraints, an International Journal, 5, 141–160.
Dell’Amico, M., & Martello, S. (1997). The k-cardinality assignment problem. Discrete Applied Mathematics, 76, 103–121.
Dell’Amico, M., & Toth, P. (2000). Algorithms and codes for dense assignment problems: the state of the art. Discrete Applied Mathematics, 100, 17–48.
Goldberg, A. V., & Kennnedy, J. R. (1995). An efficient cost scaling algorithm for the assignment problem. Mathematical Programming, 71, 153–177.
Hsieh, A. J., Fan, K. C., & Fan, T. I. (1995). Bipartite weighted matching for on-line handwritten Chinese character recognition. Pattern Recognition, 28, 143–151.
Jonker, R., & Volgenant, A. (1987). A shortest augmenting path algorithm for dense and sparse linear assignment problems. Computing, 38, 325–340.
Knuth, D. E. (1981). The Art of Computer Programming, Vol. 2: Seminumerical Algorithms. Reading: Addison-Wesley.
Machol, R. E., & Wien, M. (1976). A hard assignment problem. Operations Research, 24, 190–192.
Mosheiov, G., & Yovel, U. (2006). Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs. European Journal of Operational Research, 172, 528–544.
Pinedo, M. (2002). Scheduling Theory, Algorithms, and Systems (2nd edn.). Upper Saddle River: Prentice Hall.
Wiel Vander, R. J., & Sahinidis, N. V. (1997). The assignment problem with external interactions. Networks, 30, 171–185.
Volgenant, A. (1996). Linear and semi-assignment problems, a core oriented approach. Computers & Operations Research, 10, 917–932.
Volgenant, A. (2004). Solving the k-cardinality assignment problem by transformation. European Journal of Operational Research, 157, 322–331.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Bijsterbosch, J., Volgenant, A. Solving the Rectangular assignment problem and applications. Ann Oper Res 181, 443–462 (2010). https://doi.org/10.1007/s10479-010-0757-3
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-010-0757-3