Making the first solution good! - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Making the first solution good!


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.
Fichier principal
Vignette du fichier
bbs.pdf (238.41 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01629182 , version 1 (06-11-2017)



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. ⟨10.1109/ICTAI.2017.00164⟩. ⟨hal-01629182⟩
353 View
676 Download



Gmail Facebook X LinkedIn More