Local Branching in a Constraint Programming Framework

Parisini, Fabio

doi:10.4230/LIPIcs.ICLP.2010.286

Document

Local Branching in a Constraint Programming Framework

Author Fabio Parisini

Part of: Volume: Technical Communications of the 26th International Conference on Logic Programming (ICLP 2010)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: International Conference on Logic Programming (ICLP)
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
Publication Date: 2010-06-25

PDF

File

PDF

LIPIcs.ICLP.2010.286.pdf

Filesize: 88 kB
3 pages

Document Identifiers

DOI: 10.4230/LIPIcs.ICLP.2010.286
URN: urn:nbn:de:0030-drops-26104

Subject Classification

Keywords

Local Branching
LDS
Local Search
Tree Search
Constraint Programming

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

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.

Cite As Get 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

Author Details

Fabio Parisini

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail