Abstract
The (axial) three index assignment problem, also known as the three-dimensional matching problem, is the problem of assigning one item to one job at one point or interval of time in such a way as to minimize the total cost of the assignment. Until now the most efficient algorithms explored for solving this problem are based on polyhedral combinatorics. So far, four important facet classes Q, P, B and C have been characterized and O(n3 )(linear-time) separation algorithms for five facet subclasses of Q, P and B have been established. The complexity of these separation algorithms is best possible since the number of the variables of three index assignment problem of order n is n3. In this paper, we review these progresses and raise some further questions on this topic.
Supported by the Australian Research Council.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Balas, E. and Qi, L. (1993). Linear-time separation algorithms for the three-index assignment polytope. Discrete Applied Mathematics, 43:1–12.
Balas, E. and Saltzman, M. (1989). Facets of the three-index assignment polytope. Discrete Applied Mathematics, 23:201–229.
Balas, E. and Saltzman, M. (1991). An algorithm for the three-index assignment problem. Oper. Res., 39:150–161.
Burkard, R. and Fröhlich, K. (1980). Some remarks on the three-dimensional assignment problem. Method of Oper. Res., 36:31–36.
Burkard, R. and Rudolf, R. (1997). Computational investigations on 3-dimensional axial assignment problems. Belgian Journal of Operations Research, Statistics and Computer Science.
Euler, R. (1987). Odd cycles and a class of facets of the axial 3-index assignment polytope. Applicationes Mathematicae (Zastosowania Matematyki), XIX:375–386.
Frieze, A. (1983). Complexity of a 3-dimensional assignment problem. European J. Oper. Res., 13:161–164.
Fröhlich, K. (1979). Dreidimenionale Zuordnungsprobleme. Diplomarbeit, Mathematisches Institut, Universität zu Köln, Germany.
Garey, M. and Johnson, D. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA.
Gwan, G. (1993). A Polyhedral Method for the Three Index Assignment Problem. PhD thesis, School of Mathematics, University of New South Wales, Sydney 2051, Australia.
Gwan, G. and Qi, L. (1992). On facets of the three-index assignment polytope. Australasian J. Combinatorics, 6:67–87.
Hansen, P. and Kaufman, L. (1973). A primaldual algorithm for the three-dimensional assignment problem. Cahiers du CERO, 15:327–336.
Qi, L., Balas, E. and Gwan, G. (1994). A new facet class and a polyhedral method for the three-index assignment problem. In Advances in Optimization and Approximation, pages 256–274. Kluwer Academic Publishers, Dordrecht.
Leue, O. (1972). Methoden zur lösung dreidimensionaler zuordnungsprobleme. Angewandte Informatik, pages 154–162.
Nemhauser, G. L. and Wolsey, L. A. (1988). Integer and Combinatorial Optimization. John Wiley & Sons, New York.
Pierskalla, W. (1967). The tri-substitution method for the three-dimensional assignment problem. CORS J., 5:71–81.
Pierskalla, W. (1968). The multidimensional assignment problem. Oper. Res., 16:422–431.
Burkard, R.E., Rüdiger, R., and Gerhard, W. (1996). Three-dimensional axial assignment problems with decomposable cost coefficients. Discrete Appl. Math., 65:123–139.
Rudolf, R. (1991). Dreidimensionale axiale Zuordnungsprobleme. Technische Universität Graz, Austria. Master Thesis.
Vlach, M. (1967). Branch and bound method for the three index assignment problem. Ekonomicko-Mathematický Obzor, 3:181–191.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Qi, L., Sun, D. (2000). Polyhedral Methods for Solving Three Index Assignment Problems. In: Pardalos, P.M., Pitsoulis, L.S. (eds) Nonlinear Assignment Problems. Combinatorial Optimization, vol 7. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3155-2_5
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3155-2_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4841-0
Online ISBN: 978-1-4757-3155-2
eBook Packages: Springer Book Archive