2026-07-22T07:05:17Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:2610 2024-03-06T10:33:35Z ddc:004 open_access

Local Branching in a Constraint Programming Framework Parisini, Fabio Local Branching LDS Local Search Tree Search Constraint Programming 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Fabio Parisini 2010 Is Part Of LIPIcs, Volume 7, Technical Communications of the 26th International Conference on Logic Programming (2010) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.ICLP.2010.286 urn:nbn:de:0030-drops-26104 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2010.286 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode