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

Simple item page
dc.creatorHofman, Radoslaw
dc.date2008-05-30
dc.date2008-06-02
dc.date.accessioned2026-07-07T09:41:52Z
dc.date.available2026-07-07T09:41:52Z
dc.descriptionThis 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.
dc.descriptionCounter example for extended version of Diaby model for his publication in arXiv:0803.4354v1 [cs.DM]
dc.identifierhttps://arxiv.org/abs/0805.4718
dc.identifierhttp://arxiv.org/abs/0805.4718
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/161981
dc.subjectComputational Complexity
dc.subjectDiscrete Mathematics
dc.subjectG.1.6; G.2.1; G.2.2
dc.titleReport on article The Travelling Salesman Problem: A Linear Programming Formulation
dc.typetext

Files

Collections

arXiv