Algorithms for finding a \(K\)th best valued assignment

DOI10.1016/0166-218X(92)00175-LzbMath0809.90109MaRDI QIDQ1327213

Akihisa Tamura, Tomomi Matsui, Yoshiko T. Ikebe

Publication date: 18 July 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

bipartite graphassignmentvalued perfect matchings

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

Adjacency of the best and second best valued solutions in combinatorial optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• A Lagrangean relaxation method for the constrained assignment problem
• Algorithms for finding k-best perfect matchings
• Programming in networks and graphs. On the combinatorial background and near-equivalence of network flow and matching algorithms
• Resource constrained assignment problems
• Finding all the perfect matchings in bipartite graphs
• A Successive Shortest Path Algorithm for The Assignment Problem
• Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost