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

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
Counter example for extended version of Diaby model for his publication in arXiv:0803.4354v1 [cs.DM]

Keywords

Computational Complexity, Discrete Mathematics, G.1.6; G.2.1; G.2.2

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/161981

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0805.4718
 http://arxiv.org/abs/0805.4718

Collections

arXiv