Abstract
Let (S 1, S 2,...,S n ) be a sequence of n pairwise edge-disjoint perfect matchings on the complete bipartite graph K n,n and let D = (d ij ) be a n ×n matrix whose entries d ij ≥ 0 for all i,j = l,2,…,n are the edge weights. Denote by (D 1, D 2,...,D n) the sequence of matrices n × n and a scalar T such that:
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
Avis, D. and Devroye, L., 1985, An Analysis of a Decomposition Heuristic For The Assignment Problem, Operations Research Letters 3, No 6:279–283.
Balas, E. and Landweer, P.R., 1984, Traffic Assignment in Communication Satellites, Operations Research Letters 2, No 4:141–147.
Carpaneto, G. and Toth, P., 1981, Algorithm For The Solution of The Bottleneck Assignment Problem, Computing 127:179–187.
Carraresi, P. and Gallo, G., 1984, A Multi-Level Bottleneck Assignment Approach to the Bus Drivers Rostering Problem, European Journal of Operational Research, No 16:163–173.
Derigs, U., 1984, Alternate Strategies For Solving Bottleneck Assignment Problems-Analysis and Computational Results, Computing 133:95–106
Derigs, U. and Zimmermann, U., 1987, An Augmenting Path Method For Solving Linear Bottleneck Assignment Problems, Computing 119:285–295
Garcia, S., 1990, Heurístka Polinomial para Obtenção de Seqüência Min-Max Disjunta de n Matchings Perfeitos em Kn× de Grande Porte, Master of Science Thesis of the Military Institute of Engineering-IME.
Garfinkel, R.S., 1971, An Improved Algorithm For The Bottleneck Assignment Problem, Operations Research 119:1747–1751
Inukai, T., 1979, An Efficient SS/TDMA Time Slot Assignment Algorithm, IEEE, Vol. COM-27, № 10:1449–1455.
Ito, Y, Urano, Y, Muratani, T. and Yamaguchi, M., 1977, Analysis of a Switch Matrix for an SS/TDMA System, Proceedings of the IEEE 165:411–419.
Kurtzberg, J.M., 1962, On Approximation Methods for the Assignment Problem, J ACM 9:419–439.
Paias, A.M., 1988, Sistema Interactivo para Geração dos Horários de Condutores de Viaturas, Investigação Operacional 8, 1:47–53.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1992 Springer Science+Business Media New York
About this chapter
Cite this chapter
Campello, R.E. (1992). An O (n2.5) Time Heuristic Algorithm for a Class of Large Weighted Edge Colouring Problems. In: Baeza-Yates, R., Manber, U. (eds) Computer Science. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3422-8_12
Download citation
DOI: https://doi.org/10.1007/978-1-4615-3422-8_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6513-6
Online ISBN: 978-1-4615-3422-8
eBook Packages: Springer Book Archive