Making the first solution good!

Abstract : Providing efficient black-box search procedures is one of the major concerns for constraint-programming solvers. Most of the contributions in that area follow the fail-first principle, which is very useful to close the search tree or to solve SAT/UNSAT problems. However, for real-life applications with an optimization criterion, proving optimality is often unrealistic. Instead, it is very important to compute a good solution fast. This paper introduces a value selector heuristic focusing on objective bounds to make the first solution good. Experiments show that it improves former approaches on a wide range of problems.
Type de document :
Communication dans un congrès
ICTAI 2017 29th IEEE International Conference on Tools with Artificial Intelligence, Nov 2017, Boston, MA, United States
Liste complète des métadonnées

Littérature citée [20 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01629182
Contributeur : Charles Prud'Homme <>
Soumis le : lundi 6 novembre 2017 - 10:20:20
Dernière modification le : mardi 4 septembre 2018 - 11:04:01

Fichier

bbs.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01629182, version 1

Citation

Jean-Guillaume Fages, Charles Prud'Homme. Making the first solution good!. ICTAI 2017 29th IEEE International Conference on Tools with Artificial Intelligence, Nov 2017, Boston, MA, United States. 〈hal-01629182〉

Partager

Métriques

Consultations de la notice

422

Téléchargements de fichiers

298