Three-dimensional axial assignment problems with decomposable cost coefficients

Discrete Applied Mathematics

Volumn 65, Issue 1-3, 1996, Pages 123-139

  Burkard, Rainer E ^a   Rudolf, Rüdiger ^a   Woeginger, Gerhard J ^a  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Complexity; Decomposable cost coefficients; Heuristics; Special cases; Three dimensional assignment problems

Indexed keywords

EID: 0012742214     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(95)00031-L     Document Type: Article

References (18)

1. A. Aggarwal and J.K. Park, Parallel searching in multidimensional monotone arrays, Research Report RC 14826, IBM T.J. Watson Research Center, Yorktown Heights, NY (1989), submitted to J. Algorithms. Parts of this paper appeared in: Notes on Searching in Multidimensional Monotone Arrays, Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science (1988) 497-512.
2. A. Aggarwal and J.K. Park, Parallel searching in multidimensional monotone arrays, Research Report RC 14826, IBM T.J. Watson Research Center, Yorktown Heights, NY (1989), submitted to J. Algorithms. Parts of this paper appeared in: Notes on Searching in Multidimensional Monotone Arrays, Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science (1988) 497-512.
3. A. Aggarwal and J.K. Park, Sequential searching in multidimensional monotone arrays, Research Report RC 15128, IBM T.J. Watson Research Center, Yorktown Heights, NY (1989), submitted to J. Algorithms. Parts of this paper appeared in: Notes on Searching in Multidimensional Monotone Arrays, Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science (1988) 497-512.
4. A. Aggarwal and J.K. Park, Sequential searching in multidimensional monotone arrays, Research Report RC 15128, IBM T.J. Watson Research Center, Yorktown Heights, NY (1989), submitted to J. Algorithms. Parts of this paper appeared in: Notes on Searching in Multidimensional Monotone Arrays, Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science (1988) 497-512.
5. E. Balas and M.J. Saltzman, An algorithm for the three-index assignment problem, Oper. Res. 39 (1991) 150-161.
6. W. Bein, P. Brucker, J.K. Park and P.K. Pathak, A Monge property for the d-dimensional transportation problem, Discrete Appl., Math. 58 (1995) 97-109.
7. M. Slum, R.W. Floyd, V.R. Pratt, R.L. Rivest and R.E. Tarjan, Time bounds for selection, J. Comput. System Sci. 7 (1972) 448-461.
8. R.E. Burkard and K. Fröhlich, Some remarks on 3-dimensional assignment problems, Methods Oper. Res. 36 (1980) 31-36.
9. R.E. Burkard and R. Rudolf, Computational investigations on 3-dimensional axial assignment problems, Belgian J. Oper. Res. Statist. Comput. Sci. 32 (1-2) (1993) 85-98.
10. Y. Crama and F.C.R. Spieksma, Approximation algorithms for three-dimensional assignment problems with triangle inequalities, European J. Oper. Res. 60 (1992) 273-379.
11. K. Fröhlich, Dreidimensionale Zuordnungsprobleme, Masters Thesis, Math. Institut, Universität Köln (1979).
12. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, CA, 1979).
13. P. Hansen and L. Kaufman, A primal-dual algorithm for the three-dimensional assignment problem, Cahiers CERO 15 (1973) 327-336.
14. G.H. Hardy, J.E. Littlewood and G. Pòlya, Inequalities (Cambridge University Press, Cambridge, 1967) 260ff.
15. R.M. Karp, Reducibility among combinatorial problems, in: R.E. Miller and J.W. Thatcher, eds., Proceedings of the Complexity of Computer Computations (Plenum Press, New York, 1972) 85-104.
16. W.P. Pierskalla, The multidimensional assignment problem, Oper. Res. 16 (1968) 422-431.
17. R. Rudolf, Dreidimensionale axiale Zuordnungsprobleme, Masters Thesis, Technical University Graz, Graz (1991).
18. M. Vlach, Branch and bound method for the three-index assignment problem, Ekonom.-Mat. Obzor 2 (1967) 181-191.