Algorithms for finding a Kth best valued assignment

Discrete Applied Mathematics

Volumn 50, Issue 3, 1994, Pages 283-296

  Matsui, Tomomi ^a   Tamura, Akihisa ^b   Ikebe, Yoshiko ^b  

^a TOKYO UNIVERSITY OF SCIENCE   (Japan)

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 38149147151     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/0166-218X(92)00175-L     Document Type: Article

References (11)

1. Resource constrained assignment problem
2. A Lagrangian-relaxation method for the constrained assignment problem
3. A Primal Method for the Assignment and Transportation Problems
4. Algorithms for finding K-best perfect matchings
5. A successive shortest path algorithm for the assignment problem
6. Finding all the perfect matchings in Bipartite graphs
7. Tree search method for optimal core management or pressurized water reactors
8. The Hungarian method for the assignment problem
9. Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost