The problem of locating a single new facility relative to existing facilities has been studied extensively under the assumption that trips are always made between the new facility and a single existing facility each time a trip occurs. An iterative procedure is presented for solving the traveling salesman location problem; computational experience with the procedure is provided.

  • Availability:
  • Corporate Authors:

    Operations Research Society of America

    428 East Preston Street
    Baltimore, MD  United States  21202
  • Authors:
    • Burness, R C
    • White, J A
  • Publication Date: 1976-11

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 00159668
  • Record Type: Publication
  • Source Agency: Engineering Index
  • Files: TRIS
  • Created Date: Apr 12 1978 12:00AM