A O(n^8) X O(n^7) Linear Programming Model of the Traveling Salesman Problem

Details A O(n^8) X O(n^7) Linear Programming Model of the Traveling Salesman Problem A O(n^8) X O(n^7) Linear Programming Model of the Traveling Salesman Problem

2008-03-30

arxiv.org/abs/0803.4354v2

Computer Science

Discrete Mathematics

21 pages; An Excel VBA that generates the LP model (i.e., the MPS file) for arbitrary TSP instances is available at: http://

Scientific paper

Theorem 25 and Corollary 26 are incorrect. The modeling needs 9-dimensional variables instead of the 8-dimensional variables defined in notations 10.2. Examples of the correct model (with 9-index variables) are: (1) Diaby, M., "Linear Programming Formulation of the Set Partitioning Problem," International Journal of Operational Research 8:4 (August 2010) pp. 399-427; (2) Diaby, M., "Linear Programming Formulation of the Vertex Coloring Problem," International Journal of Mathematics in Operational Research 2:3 (May 2010) pp. 259-289; (3) Diaby, M., "The Traveling Salesman Problem: A Linear Programming Formulation," WSEAS Transactions on Mathematics, 6:6 (June 2007) pp. 745-754.

Affiliated with

Also associated with

No associations

Rating

A O(n^8) X O(n^7) Linear Programming Model of the Traveling Salesman Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A O(n^8) X O(n^7) Linear Programming Model of the Traveling Salesman Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A O(n^8) X O(n^7) Linear Programming Model of the Traveling Salesman Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-196899