Improved filtering for weighted circuit constraints

Abstract : We study the weighted circuit constraint in the context of constraint programming. It appears as a substructure in many practical applications, particularly routing problems. We propose a domain filtering algorithm for the weighted circuit constraint that is based on the 1-tree relaxation of Held and Karp. In addition, we study domain filtering based on an additive bounding procedure that combines the 1-tree relaxation with the assignment problem relaxation. Experimental results on Traveling Salesman Problem instances demonstrate that our filtering algorithms can dramatically reduce the problem size. In particular, the search tree size and solving time can be reduced by several orders of magnitude, compared to existing constraint programming approaches. Moreover, for medium-size problem instances, our method is competitive with the state-of-the-art special-purpose TSP solver Concorde.
Type de document :
Article dans une revue
Constraints, Springer Verlag, 2012, 17 (3), pp.205--233. 〈10.1007/s10601-012-9119-x〉
Liste complète des métadonnées

Littérature citée [49 références]  Voir  Masquer  Télécharger
Contributeur : Jean-Charles Regin <>
Soumis le : lundi 11 juillet 2016 - 12:15:25
Dernière modification le : lundi 5 novembre 2018 - 15:48:02
Document(s) archivé(s) le : mercredi 12 octobre 2016 - 12:21:42


Fichiers produits par l'(les) auteur(s)




Pascal Benchimol, Willem-Jan Van Hoeve, Jean-Charles Régin, Louis-Martin Rousseau, Michel Rueher. Improved filtering for weighted circuit constraints. Constraints, Springer Verlag, 2012, 17 (3), pp.205--233. 〈10.1007/s10601-012-9119-x〉. 〈hal-01344070〉



Consultations de la notice


Téléchargements de fichiers