Hybrid Algorithms in Constraint Programming

DOI10.1007/978-3-540-73817-6_1MaRDI QIDQ3608441zbMATH OpenOpenAlexFDO

Authors

Publication date 5 March 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73817-6_1

zbMATH Keywords

constraint programminghybrid algorithmssearch

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Local Search and Constraint Programming
• Algorithmes hybrides génériques pour la résolution de problèmes de satisfaction de contraintes
• Constraint Programming and Local Search Hybrids
• Hybrid Solving Techniques
• Logic Programming

Cited in

(14)

• A unified framework for partial and hybrid search methods in constraint programming
• Multithreaded constraint programming: A hybrid approach
• A generic approach to combining stochastic algorithms with systematic constraint solvers
• Heterogeneous constraint solving
• Constraint Programming and Local Search Hybrids
• scientific article; zbMATH DE number 4033523 (Why is no real title available?)
• Local Search and Constraint Programming
• MiningZinc: a declarative framework for constraint-based mining
• Methods and Applications of Artificial Intelligence
• scientific article; zbMATH DE number 5584354 (Why is no real title available?)
• Algorithmes hybrides génériques pour la résolution de problèmes de satisfaction de contraintes
• Frontiers of Combining Systems
• Artificial Evolution
• Redundant modeling in permutation weighted constraint satisfaction problems

This page was built for publication: Hybrid Algorithms in Constraint Programming

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