2012
DOI: 10.24297/ijct.v3i1c.2773
|View full text |Cite
|
Sign up to set email alerts
|

Traveling Salesman Problem: A Case Study

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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

2013
2013
2016
2016

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
references
References 10 publications
0
0
0
Order By: Relevance