Heuristics for dynamically adapting propagation in constraint satisfaction problems

DOI10.3233/AIC-2009-0450zbMath1185.90191OpenAlexW1483520058MaRDI QIDQ3401666

Kostas Stergiou

Publication date: 1 February 2010

Published in: AI Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/aic-2009-0450

zbMATH Keywords

constraint propagationsearchconstraint programming

Mathematics Subject Classification ID

Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (5)

ASlib: a benchmark library for algorithm selection ⋮ Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects ⋮ DASH: dynamic approach for switching heuristics ⋮ Domain reduction techniques for global NLP and MINLP optimization ⋮ Revisiting restricted path consistency

This page was built for publication: Heuristics for dynamically adapting propagation in constraint satisfaction problems