Traveling Salesman Problem: A Case Study

Authors

  • Dr. Leena jain Global Institute of Management and Emerging Technologies,
  • Mr. Amit Bhanot Global Institute of Management and Emerging Technologies

DOI:

https://doi.org/10.24297/ijct.v3i1c.2773

Keywords:

Optimization technique, Linear Programming, Assignment problem. TSP, combinatorial optimization problem

Abstract

In this paper assignment based integer linear formulation presented for solving traveling salesman problem. Unfortunately, the assignment model can lead to infeasible solutions. Infeasibility removes by introducing additional constraints. Then this linear problem solved by open source software.

Downloads

Download data is not yet available.

Author Biographies

Dr. Leena jain, Global Institute of Management and Emerging Technologies,

Associate Professor & Head-MCA

Mr. Amit Bhanot, Global Institute of Management and Emerging Technologies

   

Downloads

Published

2012-08-01

How to Cite

jain, D. L., & Bhanot, M. A. (2012). Traveling Salesman Problem: A Case Study. INTERNATIONAL JOURNAL OF COMPUTERS &Amp; TECHNOLOGY, 3(1), 167–169. https://doi.org/10.24297/ijct.v3i1c.2773

Issue

Vol. 3 No. 1 (2012)

Section

Research Articles
Crossref
Scopus
Google Scholar
Europe PMC