| HAL: inria-00453242, version 1 |
| DOI: 10.1016/j.endm.2010.05.133 |
| See detailed view | BibTeX,EndNote,... |
|
|
| ISCO 2010, Hammamet : Tunisie (2010) |
|
|
|
|
| Hop-indexed Circuit-based formulations for the Travelling Salesman Problem |
|
|
| Maria Teresa Godinho 1Luis Gouveia 2 |
|
|
| (2010) |
|
|
| We discuss a new Hop-indexed Circuit-based formulation for the TSP. We show that the new formulation enhanced with some valid inequalities the new formulation dominates the previous best (compact) formulations from the literature and that it produces very tight linear bounds (with emphasis on the so-called cumulative TSP). |
|
|
|
|
|
|
|
|
|
|
| 1: | Departemento de Matematica [Beja] |
| Instituto Politecnico de Beja | |
| 2: | Centro de Investigação Operacional (CIO) |
| Universidade de Lisboa | |
| 3: | Institut de Mathématiques de Bordeaux (IMB) |
| CNRS : UMR5251 – Université Sciences et Technologies - Bordeaux I – Université Victor Segalen - Bordeaux II | |
| 4: | RealOpt (INRIA Bordeaux - Sud-Ouest) |
| INRIA – Université Sciences et Technologies - Bordeaux I – Université Victor Segalen - Bordeaux II – CNRS : UMR – École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB) | |
|
|
|
|
|
|
|
|
| Domain | : | Computer Science/Operations Research |
|
|
| TSP – Hop-Indexed Models |
| inria-00453242, version 1 | |
| http://hal.inria.fr/inria-00453242 | |
| oai:hal.inria.fr:inria-00453242 | |
| From: Pierre Pesneau | |
| Submitted on: Thursday, 4 February 2010 10:50:17 | |
| Updated on: Wednesday, 15 December 2010 13:42:47 | |