Abstract
The following algorithm is known as the Hungarian algorithm, since its source of inspiration was the mathematician of that nationality, König (7), and has as its objective a process for optimisation, starting with two sets of elements, which are inter-related by a supposedly known matrix.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Kluwer Academic Publishers
About this chapter
Cite this chapter
Gil-Aluja, J. (1998). The Hungarian assignment algorithm. In: The Interactive Management of Human Resources in Uncertainty. Applied Optimization, vol 11. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-3329-6_24
Download citation
DOI: https://doi.org/10.1007/978-1-4613-3329-6_24
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-3331-9
Online ISBN: 978-1-4613-3329-6
eBook Packages: Springer Book Archive