Local Branching in a Constraint Programming Framework

Author Fabio Parisini



PDF
Thumbnail PDF

File

LIPIcs.ICLP.2010.286.pdf
  • Filesize: 88 kB
  • 3 pages

Document Identifiers

Author Details

Fabio Parisini

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

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)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail