DROPS

Document

DOI: 10.4230/LIPIcs.ICLP.2010.286

Local Branching in a Constraint Programming Framework

Authors: Fabio Parisini

Published in: LIPIcs, Volume 7, Technical Communications of the 26th International Conference on Logic Programming (2010)

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

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)

Copy BibTex To Clipboard

@InProceedings{parisini:LIPIcs.ICLP.2010.286,
  author =	{Parisini, Fabio},
  title =	{{Local Branching in a Constraint Programming Framework}},
  booktitle =	{Technical Communications of the 26th International Conference on Logic Programming},
  pages =	{286--288},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-17-0},
  ISSN =	{1868-8969},
  year =	{2010},
  volume =	{7},
  editor =	{Hermenegildo, Manuel and Schaub, Torsten},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2010.286},
  URN =		{urn:nbn:de:0030-drops-26104},
  doi =		{10.4230/LIPIcs.ICLP.2010.286},
  annote =	{Keywords: Local Branching, LDS, Local Search, Tree Search, Constraint Programming}
}

Search Results

Documents authored by Parisini, Fabio

Local Branching in a Constraint Programming Framework

Abstract

Cite as

Thanks for your feedback!

Could not send message