Heuristics for dynamically adapting propagation in constraint satisfaction problems

DOI10.3233/AIC-2009-0450MaRDI QIDQ3401666zbMATH OpenOpenAlexFDO

Authors 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 programmingconstraint propagationsearch

Mathematics Subject Classification ID

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

Recommendations

• Adapting consistency in constraint solving
• scientific article; zbMATH DE number 2080331
• Dynamic Analysis of Bounds Versus Domain Propagation
• Principles and Practice of Constraint Programming – CP 2004
• scientific article; zbMATH DE number 2083802

Cited in

(11)

• Network-based heuristics for constraint-satisfaction problems
• Domain reduction techniques for global NLP and MINLP optimization
• Revisiting restricted path consistency
• 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
• Adaptive Constraint Satisfaction: The Quickest First Principle
• Dynamic Management of Heuristics for Solving Structured CSPs
• Adapting consistency in constraint solving
• Dynamic Analysis of Bounds Versus Domain Propagation
• Heuristic-based backtracking relaxation for propositional satisfiability

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3401666)