assignment-enumeration-python

Minimum cost k-best perfect matching. Assignment problem code is borrowed from scipy, thus affected by their license.

Reference

Chandra R. CHEGIREDDY and Horst W. HAMACHER (1987). ALGORITHMS FOR FINDING K-BEST PERFECT MATCHINGS

Tomomi Matsui, Akihisa Tamura and Yoshiko Ikebe (1992) Algorithms for finding a Kth best valued assignment

K. Fukuda and T. Matsui (1993) Finding All the Perfect Matchings in Bipartite Graphs