Interleaving constraint propagation: An efficient cooperative search with branch and bound

Eric Monfroy 1, 2 Broderick Crawford 3 Ricardo Soto 3
2 TASC - Theory, Algorithms and Systems for Constraints
LINA - Laboratoire d'Informatique de Nantes Atlantique, Département informatique - EMN, Inria Rennes – Bretagne Atlantique
Type de document :
Communication dans un congrès
The 8th International Workshop on Hybrid Metaheuristics, 2013, Ischia, Italy. Springer, 7919, pp.52-61, 2013, Lecture Notes in Computer Science
Liste complète des métadonnées

https://hal.inria.fr/hal-00875542
Contributeur : Eric Monfroy <>
Soumis le : mardi 22 octobre 2013 - 11:50:58
Dernière modification le : mercredi 11 avril 2018 - 02:01:25

Identifiants

  • HAL Id : hal-00875542, version 1

Collections

Citation

Eric Monfroy, Broderick Crawford, Ricardo Soto. Interleaving constraint propagation: An efficient cooperative search with branch and bound. The 8th International Workshop on Hybrid Metaheuristics, 2013, Ischia, Italy. Springer, 7919, pp.52-61, 2013, Lecture Notes in Computer Science. 〈hal-00875542〉

Partager

Métriques

Consultations de la notice

123