Algorithms for finding K-best perfect matchings

Discrete Applied Mathematics

Volumn 18, Issue 2, 1987, Pages 155-165

  Chegireddy, Chandra R ^a   Hamacher, Horst W ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING - ALGORITHMS; OPTIMIZATION;

BINARY PARTITIONING; COMBINATORIAL OPTIMIZATION; K-BEST PERFECT MATCHINGS;

MATHEMATICAL TECHNIQUES;

EID: 0022153212     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(87)90017-5     Document Type: Article

References (17)

1. A dual shortest path algorithm
2. A primal method for solving minimal perfect matching problems
3. Shortest alternating path algorithms
4. Algorithms and programs for K-th best weighted bipartite matching problem
5. A shortest augmenting path method for solving minimal perfect matching problems
6. Shortest augmenting paths and sensititivity analysis for optimal matchings
7. A note on two problems in connection with graphs
8. Paths trees and flowers
9. Theoretical improvements in algorithmic efficiency for network flow problems
10. Algorithm 97 shortest path
11. Shortest path methods: A unifying approach
12. K-best solutions to combinatorial optimization problems
13. A procedure for computing the K-th best solutions to discrete optimization problems and its application to the shortest path problem
14. An algorithm for ranking all the assignments in order of increasing cost
15. Algorithm 562 shortest path lengths
16. Sensitivity analysis of optimal matchings