LIPIcs.ICLP.2010.286.pdf
- Filesize: 88 kB
- 3 pages
Document
Local Branching in a Constraint Programming Framework
Author
-
Part of:
Volume:
Technical Communications of the 26th International Conference on Logic Programming
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Logic Programming (ICLP) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication date: 2010-06-25
Cite AsGet BibTex
Fabio Parisini. Local Branching in a Constraint Programming Framework. In Technical Communications of the 26th International Conference on Logic Programming. Leibniz International Proceedings in Informatics (LIPIcs), Volume 7, pp. 286-288, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2010)
https://doi.org/10.4230/LIPIcs.ICLP.2010.286
https://doi.org/10.4230/LIPIcs.ICLP.2010.286
Abstract
We argue that integrating local branching in CP merges the advantages of the intensification and diversification mechanisms specific to local search methods, with constraint propagation that speeds up the neighborhood exploration by removing infeasible variable value assignments.
Keywords
- Local Branching
- LDS
- Local Search
- Tree Search
- Constraint Programming
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads