Using local search to speed up filtering algorithms for some NP-hard constraints

2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Galinier, P., Hertz, A., Paroz, S., & Pesant, G. (2008). Using local search to speed up filtering algorithms for some NP-hard constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5015 LNCS, pp. 298–302). https://doi.org/10.1007/978-3-540-68155-7_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free