Abstract
A problem which is strongly related to SMP is the bottleneck matching problem (BMP). Here we associate with every M ∊ μp the costs
and again the problem is to find a perfect matching M ∊ μp with minimal costs i.e.
The connection to LBAP is the same as between LSAP and SMP.
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
© 1980 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Burkard, R.E., Derigs, U. (1980). The Bottleneck Matching Problem. In: Assignment and Matching Problems: Solution Methods with FORTRAN-Programs. Lecture Notes in Economics and Mathematical Systems, vol 184. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-51576-7_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-51576-7_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10267-0
Online ISBN: 978-3-642-51576-7
eBook Packages: Springer Book Archive