Skip to Main content Skip to Navigation
New interface
Conference papers

Hop-indexed Circuit-based formulations for the Travelling Salesman Problem

Maria Teresa Godinho 1 Luís Gouveia 2 Pierre Pesneau 3, 4 
4 Realopt - Reformulations based algorithms for Combinatorial Optimization
LaBRI - Laboratoire Bordelais de Recherche en Informatique, IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
Abstract : 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).
Document type :
Conference papers
Complete list of metadata
Contributor : Pierre Pesneau Connect in order to contact the contributor
Submitted on : Thursday, February 4, 2010 - 10:50:17 AM
Last modification on : Friday, August 5, 2022 - 12:39:49 PM




Maria Teresa Godinho, Luís Gouveia, Pierre Pesneau. Hop-indexed Circuit-based formulations for the Travelling Salesman Problem. ISCO 2010, Mar 2010, Hammamet, Tunisia. pp.1049-1056, ⟨10.1016/j.endm.2010.05.133⟩. ⟨inria-00453242⟩



Record views