Text

A computational procedure for solving traveling-salesman problems

About this Digital Document

The traveling salesman problem is a generalized form of the simple problem of finding the shortest closed loop that connects several points in a plane. This thesis covers a basic combinatorial approach to the problem.

Full Title
A computational procedure for solving traveling-salesman problems
Member of
Theses and Dissertations
Contributor(s)
Creator: Wilser, Fred A.
Thesis advisor: Smith, William A.
Publisher
Lehigh University
Date Issued
1964-05
Language
English
Type
Text
Genre
theses
Form
electronic documents
Department name
Industrial Engineering
Digital Format
electronic documents
Media type
application/pdf
Creator role
Graduate Student
Identifier
1048261254
https://asa.lib.lehigh.edu/Record/10946538
Keywords
Mathematics

Citation


        
      

              

        
@mastersthesis{wilser1964,
  title = {A computational procedure for solving traveling-salesman problems},
  author = {Wilser, Fred},
  year = {1964},
  month = may,
  publisher = {Lehigh University},
  isbn = {1048261254},
  url = {https://asa.lib.lehigh.edu/Record/10946538},
  keywords = {Mathematics},
  abstract = {The traveling salesman problem is a generalized form of the simple problem of finding the shortest closed loop that connects several points in a plane. This thesis covers a basic combinatorial approach to the problem.},
  language = {English},
}