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]
< Réduire
Institut de Mathématiques de Bordeaux [IMB]
Reformulations based algorithms for Combinatorial Optimization [Realopt]
Langue
en
Communication dans un congrès
Ce document a été publié dans
ISCO 2010, 2010-03, Hammamet. 2010, vol. 36, p. 1049-1056
Résumé en anglais
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 ...Lire la suite >
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).< Réduire
Origine
Importé de halUnités de recherche