Maintaining soft arc consistencies in BnB-ADOPT+ during search
Refereed conference paper presented and published in conference proceedings


Times Cited
Altmetrics Information
.

Other information
AbstractGutierrez and Meseguer show how to enforce consistency in BnB-ADOPT + for distributed constraint optimization, but they consider unconditional deletions only. However, during search, more values can be pruned conditionally according to variable instantiations that define subproblems. Enforcing consistency in these subproblems can cause further search space reduction. We introduce efficient methods to maintain soft arc consistencies in every subproblem during search, a non trivial task due to asynchronicity and induced overheads. Experimental results show substantial benefits on three different benchmarks. © 2013 Springer-Verlag.
All Author(s) ListGutierrez P., Lee J.H.M., Lei K.M., Mak T.W.K., Meseguer P.
Name of Conference19th International Conference on Principles and Practice of Constraint Programming, CP 2013
Start Date of Conference16/09/2013
End Date of Conference20/09/2013
Place of ConferenceUppsala
Country/Region of ConferenceSweden
Year2013
Month10
Day22
Volume Number8124 LNCS
PublisherSpringer Verlag
Place of PublicationGermany
Pages365 - 380
ISBN9783642406263
ISSN0302-9743
LanguagesEnglish-United Kingdom

Last updated on 2020-20-10 at 00:41