TY - JOUR
T1 - Algorithms for finding a Kth best valued assignment
AU - Matsui, Tomomi
AU - Tamura, Akihisa
AU - Ikebe, Yoshiko
PY - 1994/5/20
Y1 - 1994/5/20
N2 - We consider a new problem, the Kth best valued assignment problem. Given a bipartite graph G and a cost vector w on its edge set, this is the problem of finding a perfect matching Mk in G such that there exist perfect matchings M1,...,MK-1 satisfying w(M1) < ⋯ < w(MK-1) < w(MK), and w(MK) < w(M) for all perfect matchings M with w(M) ≠ w(M1),...,w(MK). Here w(M) denotes the sum of costs of edges in M. In this paper, we propose two algorithms for solving this problem and verify the efficiency of our algorithms by our preliminary computational experiments.
AB - We consider a new problem, the Kth best valued assignment problem. Given a bipartite graph G and a cost vector w on its edge set, this is the problem of finding a perfect matching Mk in G such that there exist perfect matchings M1,...,MK-1 satisfying w(M1) < ⋯ < w(MK-1) < w(MK), and w(MK) < w(M) for all perfect matchings M with w(M) ≠ w(M1),...,w(MK). Here w(M) denotes the sum of costs of edges in M. In this paper, we propose two algorithms for solving this problem and verify the efficiency of our algorithms by our preliminary computational experiments.
UR - http://www.scopus.com/inward/record.url?scp=38149147151&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=38149147151&partnerID=8YFLogxK
U2 - 10.1016/0166-218X(92)00175-L
DO - 10.1016/0166-218X(92)00175-L
M3 - Article
AN - SCOPUS:38149147151
VL - 50
SP - 283
EP - 296
JO - Discrete Applied Mathematics
JF - Discrete Applied Mathematics
SN - 0166-218X
IS - 3
ER -