THE SYMMETRIC ASSIGNMENT PROBLEM
CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER
Pagination or Media Count:
A branch and bound algorithm for finding the minimal cost symmetric assignment is discussed. The matching problem in graph theory and the Chinese Postman puzzle are all special cases of the symmetric assignment problem, and hence this algorithm can be applied to solve them.
- Operations Research