Report on article The Travelling Salesman Problem: A Linear Programming Formulation

Details Report on article The Travelling Salesman Problem: A Linear Programming Formulation Report on article The Travelling Salesman Problem: A Linear Programming Formulation

2008-05-30

arxiv.org/abs/0805.4718v2

Computer Science

Computational Complexity

Counter example for extended version of Diaby model for his publication in arXiv:0803.4354v1 [cs.DM]

Scientific paper

This article describes counter example prepared in order to prove that linear
formulation of TSP problem proposed in [arXiv:0803.4354] is incorrect (it
applies also to QAP problem formulation in [arXiv:0802.4307]). Article refers
not only to model itself, but also to ability of extension of proposed model to
be correct.

Affiliated with

Also associated with

No associations

Rating

Report on article The Travelling Salesman Problem: A Linear Programming Formulation 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 Report on article The Travelling Salesman Problem: A Linear Programming Formulation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Report on article The Travelling Salesman Problem: A Linear Programming Formulation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-317628