The M-Travelling Salesmen Problem.

Abstract

This paper develops the number of feasible solutions (m-tours) for both the asymmetric and symmetric m-travelling salesmen problems. The proofs are constructive and it is shown how these results may be used to design an enumeration tree for incorporation within a general branch-and-bound algorithm. In addition, for the m-travelling salesmen problem defined over the Euclidean vector space in which the number of salesmen used is a decision variable, it is shown that there exists an optimal tour using only one salesman. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jul 01, 1980
Accession Number
ADA092949

Entities

People

  • I. Ali
  • J. Kennington

Organizations

  • University of Texas at Austin

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Construction
  • Contracts
  • Inequalities
  • Integer Programming
  • Military Research
  • Plastic Explosives
  • Scientific Research
  • Theses
  • Triangles
  • Universities
  • Vector Spaces

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Operations Research

Technology Areas

  • Space