Nature-inspired techniques for dynamic constraint satisfaction problems

DOI10.1007/S43069-021-00116-6MaRDI QIDQ2139357zbMATH OpenOpenAlexFDO

Authors Mahdi Bidar, Malek Mouhoub

Publication date 17 May 2022

Published in SN Operations Research Forum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s43069-021-00116-6

zbMATH Keywords

combinatorial optimizationconstraint satisfaction problems (CSPs)dynamic constraintsnature-inspired techniques

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 1670594
• Dynamic algorithms for classes of constraint satisfaction problems
• Robustness and stability in constraint programming under dynamism and uncertainty
• Constraint solving in uncertain and dynamic environments: A survey
• scientific article; zbMATH DE number 2202276

Cites work

• A modified artificial bee colony algorithm
• Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
• Consistency restoration and explanations in dynamic CSPs---Application to configuration
• scientific article; zbMATH DE number 1670594 (Why is no real title available?)
• scientific article; zbMATH DE number 1448978 (Why is no real title available?)
• scientific article; zbMATH DE number 2202276 (Why is no real title available?)
• Hybrid search for minimal perturbation in dynamic CSPs
• Metaheuristics. From design to implementation.

This page was built for publication: Nature-inspired techniques for dynamic constraint satisfaction problems

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