Nonlinear Assignment Problems pp 1-12 | Cite as

# Multi Index Assignment Problems: Complexity, Approximation, Applications

## Abstract

This chapter deals with approximation algorithms for and applications of multi index assignment problems (MIAPs). MIAPs and relatives of it have a relatively long history both in applications as well as in theoretical results, starting at least in the fifties (see e.g. [Motzkin, 1952], [Schell, 1955] and [Koopmans and Beckmann, 1957]). Here we intend to give the reader i) an idea of the range and diversity of practical problems that have been formulated as an MIAP, and ii) an overview on what is known on theoretical aspects of solving instances of MIAPs. In particular, we will discuss complexity and approximability issues for *special cases* of MIAPs. We feel that investigating special cases of MIAPs is an important topic since real-world instances almost always posses a certain structure that can be exploited when it comes to solving them.

## Keywords

Assignment Problem Polynomial Time Approximation Scheme Assignment Game Discrete Apply Mathematic Multidimensional Assignment Problem## Preview

Unable to display preview. Download preview PDF.

## References

- [Arbib et al., 1999]Arbib, C., Pacciarelli, D., and Smriglio, S. (1999). A threedimensional matching model for perishable production scheduling.
*Discrete Applied Mathematics*, 92:1–15.MathSciNetzbMATHCrossRefGoogle Scholar - [Arkin and Hassin, 1998]Arkin, E. and Hassin, R. (1998). On local search for weighted packing problems.
*Mathematics of Operations Research*, 23:640–648.MathSciNetzbMATHCrossRefGoogle Scholar - [Balas and Landweer, 1983]Balas, E. and Landweer, P. (1983). Traffic assignment in communication satellites.
*Operations Research Letters*, 2:141–147.zbMATHCrossRefGoogle Scholar - [Balas and Qi, 1993]Balas, E. and Qi, L. (1993). Linear time separation algorithms for the three-index assignment polytope.
*Discrete Applied Mathematics*, 43:1–12.MathSciNetzbMATHCrossRefGoogle Scholar - [Balas and Saltzman, 1989]Balas, E. and Saltzman, M. (1989). Facets of the three-index assignment polytope.
*Discrete Applied Mathematics*, 23:201–229.MathSciNetzbMATHCrossRefGoogle Scholar - [Balas and Saltzman, 1991]Balas, E. and Saltzman, M. (1991). An algorithm for the three-index assignment problem.
*Operations Research*, 39:150–161.MathSciNetzbMATHCrossRefGoogle Scholar - [Bandelt et al., 1994]Bandelt, H.J., Crama, Y., and Spieksma, F. (1994). Approximation algorithms for multidimensional assignment problems with decomposable costs.
*Discrete Applied Mathematics*, 49:25–50.MathSciNetzbMATHCrossRefGoogle Scholar - [Barvinok et al., 1998]Barvinok, A., Johnson, D., Woeginger, G., and Woodroofe, R. (1998). Finding maximum length tours under polyhedral norms. In
*Report Woe-20*. TU Graz.Google Scholar - [Burkard and Fröhlich, 1980]Burkard, R. and Fröhlich, K. (1980). Some remarks on 3-dimensional assignment problems.
*Methods of Operations Research*, 36:31–36.zbMATHGoogle Scholar - [Burkard and Rudolf, 1993]Burkard, R. and Rudolf, R. (1993). Computational investigations on 3-dimensional axial assignment problems.
*Belgian Journal of Operations Research, Statistics and Computer Science*, 32:85–98.Google Scholar - [Burkard et al., 1996]Burkard, R., Rudolf, R., and Woeginger, G. (1996). Three-dimensional axial assignment problems with decomposable costcoefficients.
*Discrete Applied Mathematics*, 65:123–140.MathSciNetzbMATHCrossRefGoogle Scholar - [Crama et al., 1996]Crama, Y., Oerlemans, A., and Spieksma, F. (1996).
*Production planning in automated manufacturing*. Springer Verlag.CrossRefGoogle Scholar - [Crama and Spieksma, 1992]Crama, Y. and Spieksma, F. (1992). Approximation algorithms for three-dimensional assignment problems with triangle inequalities.
*European Journal of Operational Research*, 60:273–279.zbMATHCrossRefGoogle Scholar - [Crescenzi and Kann, 1999]Crescenzi, P. and Kann, V. (1999). A compendium of NP optimization problems. http://www.nada.kth.se/∼viggo/wwwcompendium/.Google Scholar
- [Dyer and Frieze, 1983]Dyer, M. and Frieze, A. (1983). Planar 3dm is npcomplete.
*Journal of Algorithms*, 7:174–184.MathSciNetCrossRefGoogle Scholar - [Euler et al., 1986]Euler, R., Burkard, R., and Grommes, R. (1986). On latin squares and the facial structure of related polytopes.
*Discrete Mathematics*, 62:155–181.MathSciNetzbMATHCrossRefGoogle Scholar - [Evans, 1981 ]Evans, J. (1981). The multicommodity assignment problem: a network aggregation heuristic.
*Computers and Mathematics with Applications*, 7:187–194.MathSciNetCrossRefGoogle Scholar - [Fortin and Tusera, 1994]Fortin, D. and Tusera, A. (1994). Routing in meshes using linear assignment. In A. Bachem, U. Derigs, and Schrader, R., editors,
*Operations Research ’93*, pages 169–171.Google Scholar - [Frieze, 1983]Frieze, A. (1983). Complexity of a 3-dimensional assignment problem.
*European Journal of Operational Research*, 13:161–164.MathSciNetzbMATHCrossRefGoogle Scholar - [Geetha and Vartak, 1989]Geetha, S. and Vartak, M. (1989). Time-cost tradeoff in a three dimensional assignment problem.
*European Journal of Operational Research*, 38:255–258.MathSciNetzbMATHCrossRefGoogle Scholar - [Geetha and Vartak, 1994]Geetha, S. and Vartak, M. (1994). The threedimensional bottleneck assignment problem with capacity constraints.
*European Journal of Operational Research*, 73:562–568.zbMATHCrossRefGoogle Scholar - [Gilbert and Hofstra, 1987]Gilbert, K. and Hofstra, R. (1987). An algorithm for a class of three-dimensional assignment problems arising in scheduling applications.
*IIE Transactions*, 8:29–33.CrossRefGoogle Scholar - [Gilbert and Hofstra, 1988]Gilbert, K. and Hofstra, R. (1988). Multidimensional assignment problems.
*Decision Sciences*, 19:306–321.CrossRefGoogle Scholar - [Gwan and Qi, 1992]Gwan, G. and Qi, L. (1992). On facet of the three index assignment polytope.
*Australasian Journal of Combinatorics*, 6:67–87.MathSciNetzbMATHGoogle Scholar - [Hansen and Kaufman, 1973]Hansen, P. and Kaufman, L. (1973). A primaldual algorithm for the three-dimensional assignment problem.
*Cahiers du Centre d’Etudes de Recherche Opérationnell*, 15:327–336.MathSciNetzbMATHGoogle Scholar - [Hausmann et al., 1980]Hausmann, D., Korte, B., and Jenkyns, T. (1980). Worst case analysis of greedy type algorithms for independence systems.
*Mathematical Programming*, 12:120–131.MathSciNetzbMATHGoogle Scholar - [Hilton, 1980]Hilton, A. (1980). The reconstruction of latin squares with applications to school timetabling and to experimental design.
*Mathematical Programming Study*, 13:68–77.zbMATHCrossRefGoogle Scholar - [Hurkens and Schrijver, 1989]Hurkens, C. and Schrijver, A. (1989). On the size of systems of sets every t of which have an sdr, with an application to the worst-case ratio of heuristics for packing problems.
*SIAM Journal on Discrete Mathematics*, 2:68–72.MathSciNetzbMATHCrossRefGoogle Scholar - [Kann, 1991]Kann, V. (1991). Maximum bounded 3-dimensional matching is max snp-complete.
*Information Processing Letters*, 37:27–35.MathSciNetzbMATHCrossRefGoogle Scholar - [Karp, 1972]Karp, R. (1972). Reducibility among combinatorial problems. In Miller, R. and Thatcher, J., editors,
*Complexity of Computer Computations*, pages 85–103. Plenum Press.CrossRefGoogle Scholar - [Klinz and Woeginger, 1996]Klinz, B. and Woeginger, G. (1996). A new efficiently solvable case of the three-dimensional axial bottleneck assignment problem.
*Lecture Notes in Computer Science*, 1120:150–162.MathSciNetCrossRefGoogle Scholar - [Koopmans and Beckmann, 1957]Koopmans, T. and Beckmann, M. (1957). Assignment problems and the location of economic activities.
*Econometrica*, 25:53–76.MathSciNetzbMATHCrossRefGoogle Scholar - [Kuipers, 1990]Kuipers, J. (1990). On the LP-relaxation of multi-dimensional assignment problems with applications to assignment games. In
*Report M 90–10*. Maastricht University.Google Scholar - [Leue, 1972]Leue, O. (1972). Methoden zur lösung dreidimensionaler zuordnungsprobleme.
*Angewandte Informatik*, 14:154–162.Google Scholar - [Lidstrom et al., 1999]Lidstrom, N., Pardalos, P., Pitsoulis, L., and Toraldo, G. (1999). An approximation algorithm for the three-index assignment problem. In Floudas, C. and Pardalos, P., editors,
*Encyclopedia of Optimization (to appear)*.Google Scholar - [Magos, 1996]Magos, D. (1996). Tabu search for the planar three-index assignment problem.
*Journal of Global Optimization*, 8:35–48.MathSciNetzbMATHCrossRefGoogle Scholar - [Magos and Miliotis, 1994]Magos, D. and Miliotis, P. (1994). An algorithm for the planar three-index assignment problem.
*European Journal of Operational Research*, 77:141–153.zbMATHCrossRefGoogle Scholar - [Malhotra et al., 1985]Malhotra, R., Bhatia, H., and Puri, M. (1985). The three dimensional bottleneck assignment problem and its variants.
*Optimization*, 16:245–256.MathSciNetzbMATHCrossRefGoogle Scholar - [Motzkin, 1952]Motzkin, T. (1952). The multi-index transportation problem.
*Bulletin of the American Mathematical Society*, 58:494.Google Scholar - [Murphey et al., 1998]Murphey, R., Pardalos, P., and Pitsoulis, L. (1998). A. parallel GRASP for the data association multidimensional assignment problem. In
*IMA Volumes in Mathematics and its Applications, Vol. 106*, pages 159–180. Springer-Verlag.Google Scholar - [Nishizeki and Chiba, 1988]Nishizeki, T. and Chiba, N. (1988). Planar graphs: Theory and algorithms. In
*Volume 32 of Annals of Discrete Mathematics*. Elsevier, Amsterdam.Google Scholar - [Papadimitriou, 1994]Papadimitriou, C. (1994).
*Computational Complexity*. Addison-Wesley.zbMATHGoogle Scholar - [Pattipatti et al., 1992]Pattipatti, K., Deb, S., Bar-Shalom, Y., and R.B. Washburn, J. (1992). A new relaxation algorithm passive sensor data association.
*IEEE Transactions on Automatic Control*, 37:198–213.CrossRefGoogle Scholar - [Pierskalla, 1967]Pierskalla, W. (1967). The tri-substitution method for the three-dimensional assignment problem.
*Journal of the Canadian Operational Research Society*, 5:71–81.Google Scholar - [Pierskalla, 1968]Pierskalla, W. (1968). The multidimensional assignment problem.
*Operations Research*, 16:422–431.zbMATHCrossRefGoogle Scholar - [Poore, 1994]Poore, A. (1994). Multidimensional assignment formulation of data-association problems arising from multitarget and multisensor tracking.
*Computational Optimization and Applications*, 3:27–57.MathSciNetzbMATHCrossRefGoogle Scholar - [Poore and Rijavec, 1993]Poore, A. and Rijavec, N. (1993). A lagrangian relaxation algorithm for multidimensional assignment problems arising from multitarget tracking.
*SIAM Journal on Optimization*, 3:544–563.MathSciNetzbMATHCrossRefGoogle Scholar - [Qi et al., 1994]Qi, L., Balas, E., and Gwan, G. (1994). A new facet class and a polyhedral method for the three-index assignment problem. In Du, D., editor,
*Advances in Optimization*, pages 256–274.Google Scholar - [Queyranne and Spieksma, 1999]Queyranne, M. and Spieksma, F. (1999). Multi-index transportation problems. In Floudas, C. and Pardalos, P., editors,
*Encyclopedia of Optimization (to appear)*.Google Scholar - [Schell, 1955]Schell, E. (1955). Distribution of a product by several properties. In of Management Analysis, D., editor,
*Second Symposium in Linear Programming 2*, pages 615–642. DCS/Comptroller HQ, US Air Force, Washington DC.Google Scholar - [Spieksma and Woeginger, 1996]Spieksma, F. and Woeginger, G. (1996). Geometric three-dimensional assignment problems.
*European Journal of Operatiorral Research*, 91:611–618.zbMATHCrossRefGoogle Scholar - [Vlach, 1967]Vlach, M. (1967). Branch and bound method for the three-index assignment problem.
*Ekonomicko-Matematicky Obzor*, 3:181–191.MathSciNetGoogle Scholar