Algorithms for finding K-best perfect matchings

This publication has 11 references indexed in Scilit:

• A shortest augmenting path method for solving minimal perfect matching problems
  Networks, 1981
• Sensitivity analysis of optimal matchings
  Networks, 1981
• Algorithm 562: Shortest Path Lengths [H]
  ACM Transactions on Mathematical Software, 1980
• A primal algorithm for optimum matching
  Published by Springer Nature ,1978
• Shortest alternating path algorithms
  Networks, 1974
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
  Journal of the ACM, 1972
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
  Management Science, 1972
• Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
  Operations Research, 1968
• Paths, Trees, and Flowers
  Canadian Journal of Mathematics, 1965
• A note on two problems in connexion with graphs
  Numerische Mathematik, 1959