THE SYMMETRIC ASSIGNMENT PROBLEM

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1967
Accession Number
AD0653103

Entities

People

  • Katta G. Murty

Organizations

  • University of California, Berkeley

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • California
  • Classification
  • Contractors
  • Contracts
  • Equations
  • Governments
  • Graph Theory
  • Operations Research
  • Security
  • Standards
  • Terminals
  • United States
  • United States Government
  • Universities

Readers

  • Operations Research