A Complete and irredundant linear description of the asymmetric traveling salesman polytope on 6 nodes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1992

A Complete and irredundant linear description of the asymmetric traveling salesman polytope on 6 nodes

Reinhardt Euler
Lab-STICC_UBO_CACS_MOCS
Hervé Le Verge
  • Function : Author
Parallel VLSI Architectures

Abstract

Using a refined version of Chernikova's algorithm we determined a complete and irredundant description of the asymmetric traveling salesman polytope on 6 nodes. Besides the 11 equations describing the affine hull of this polytope our description consists of 319.015 facet-defining inequalities.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1791.pdf (1.3 Mo) Télécharger le fichier

Rapport De Recherche Inria  : Connect in order to contact the contributor

https://inria.hal.science/inria-00077031

Submitted on : Monday, May 29, 2006-11:56:13 AM

Last modification on : Tuesday, August 27, 2024-12:39:56 PM

Long-term archiving on: Friday, May 13, 2011-10:37:58 PM

Download

Dates and versions

inria-00077031 , version 1 (29-05-2006)

Identifiers

  • HAL Id : inria-00077031 , version 1

Cite

Reinhardt Euler, Hervé Le Verge. A Complete and irredundant linear description of the asymmetric traveling salesman polytope on 6 nodes. [Research Report] RR-1791, INRIA. 1992. ⟨inria-00077031⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

UNIV-BREST EC-PARIS UNIV-RENNES1 CNRS INRIA INSA-RENNES IRISA INRIA-RRRT LAB-STICC_UBO ENIB LAB-STICC_ENIB LAB-STICC INRIA2 LARA UR1-MATH-STIC UR1-UFR-ISTIC UNIV-RENNES INSA-GROUPE IBNM UR1-MATH-NUM
165 View
123 Download

Share

Gmail Mastodon Facebook X LinkedIn More