Hop-indexed Circuit-based formulations for the Travelling Salesman Problem
PESNEAU, Pierre
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
PESNEAU, Pierre
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
< Leer menos
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Idioma
en
Communication dans un congrès
Este ítem está publicado en
ISCO 2010, 2010-03, Hammamet. 2010, vol. 36, p. 1049-1056
Resumen en inglés
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 ...Leer más >
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).< Leer menos
Orígen
Importado de HalCentros de investigación