License
when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-26104
URL:

Local Branching in a Constraint Programming Framework

pdf-format:


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.

BibTeX - Entry

@InProceedings{parisini:LIPIcs:2010:2610,
  author =	{Fabio Parisini},
  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 =	{Manuel Hermenegildo and Torsten Schaub},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2010/2610},
  URN =		{urn:nbn:de:0030-drops-26104},
  doi =		{http://dx.doi.org/10.4230/LIPIcs.ICLP.2010.286},
  annote =	{Keywords: Local Branching, LDS, Local Search, Tree Search, Constraint Programming}
}

Keywords: Local Branching, LDS, Local Search, Tree Search, Constraint Programming
Seminar: Technical Communications of the 26th International Conference on Logic Programming
Issue date: 2010
Date of publication: 2010


DROPS-Home | Fulltext Search | Imprint Published by LZI