Accession Number:

AD0653103

Title:

THE SYMMETRIC ASSIGNMENT PROBLEM

Descriptive Note:

Research rept.

Corporate Author:

CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER

Personal Author(s):

Report Date:

1967-02-01

Pagination or Media Count:

23.0

Abstract:

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.

Subject Categories:

  • Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE