TY  - SER
AU  - Rajendra,Nagaratnam
AU  - Oudheusden,Dirk L.Van
AU  - Fujiwara,Okitsugu
AU  - Tabucanon,Mario T.
ED  - The Royal Dutch Government, 
TI  - A TSP solution approach by integer linear programming
T2  - Special studies project report
PY  - 1982///
CY  - Bangkok
PB  - Asian Institute of Technology
KW  - Traveling-salesman problem
KW  - Linear programming
N1  - A special study submitted in partial fulfillment of the requirement for the degree of Master of Engineering, School of Engineering and Technology; Special Studies Project Report (M. Eng.) - Asian Institute of Technology, 1982
N2  - The Travelling Salesman Problem ( TSP ) is known as one of the notorious problems in Combinatorial Optimization. This  study is concerned with a solution approach to the TSP by  Integer Linear Programming . An attempt is made to identify  the greater proportion of redundant Subtour Elimination  Constraints ( SEC ) , so as to save computer storage , and  facilitate execution of the problem, with the IBM  MPSX-MIP/370 package. Also comparison of an alternative  formulation & its related computational time from an earlier study is done. The modest solution times achieved for problems recognized as test problems gives encouragement to believe that such an approach deserves further consideration
UR  - http://203.159.5.9/ait-thesis/detail.php?q=B21102
ER  -