Report on article The Travelling Salesman Problem: A Linear Programming Formulation
Computational Complexity
2008-06-02 v2 Discrete Mathematics
Abstract
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.
Keywords
Cite
@article{arxiv.0805.4718,
title = {Report on article The Travelling Salesman Problem: A Linear Programming Formulation},
author = {Radoslaw Hofman},
journal= {arXiv preprint arXiv:0805.4718},
year = {2008}
}
Comments
Counter example for extended version of Diaby model for his publication in arXiv:0803.4354v1 [cs.DM]