Showing 1 - 2 of 2
1. The Linear Sum Assignment Problem -- 2. The Linear Bottleneck Assignment Problem -- 3. The Cardinality Matching Problem -- 4. The Sum Matching Problem -- 5. The Bottleneck Matching Problem -- 6. The Chinese Postman Problem -- 7. Quadratic Assignment Problems -- 8. QAP Heuristic 1: The method...
Persistent link: https://www.econbiz.de/10013520187
Network flow and matching are often treated separately in the literature and for each class a variety of different algorithms has been developed. These algorithms are usually classified as primal, dual, primal-dual etc. The question the author addresses in this work is that of the existence of a...
Persistent link: https://www.econbiz.de/10013521481