Document
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
Contributor(s)
Creator: Wilser, Fred A.
Thesis advisor: Smith, William A.
Publisher
Lehigh University
Date Issued
1964-05
Language
English
Type
Genre
Form
electronic documents
Department name
Industrial Engineering
Digital Format
electronic documents
Media type
Creator role
Graduate Student
Identifier
1048261254
https://asa.lib.lehigh.edu/Record/10946538
Keywords
Wilser, . F. A. (1964). A computational procedure for solving traveling-salesman problems (1–). https://preserve.lehigh.edu/lehigh-scholarship/graduate-publications-theses-dissertations/theses-dissertations/computational
Wilser, Fred A. 1964. “A Computational Procedure for Solving Traveling-Salesman Problems”. https://preserve.lehigh.edu/lehigh-scholarship/graduate-publications-theses-dissertations/theses-dissertations/computational.
Wilser, Fred A. A Computational Procedure for Solving Traveling-Salesman Problems. May 1964, https://preserve.lehigh.edu/lehigh-scholarship/graduate-publications-theses-dissertations/theses-dissertations/computational.
