Abstract
Having seen the algorithm operate, now let us see how to insert it into König’s theorem. To do this we can start off from the existence of a matrix [M], with a set of rows T={T1, T2,…,Tm} and a set of columns {P=P1, P2,…, P n }.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Kluwer Academic Publishers
About this chapter
Cite this chapter
Gil-Aluja, J. (1998). Theoretical Elements of the Hungarian 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_25
Download citation
DOI: https://doi.org/10.1007/978-1-4613-3329-6_25
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-3331-9
Online ISBN: 978-1-4613-3329-6
eBook Packages: Springer Book Archive