Hybrid Algorithms in Constraint Programming
DOI10.1007/978-3-540-73817-6_1zbMATH Open1176.68204OpenAlexW1507364631MaRDI QIDQ3608441FDOQ3608441
Author name not available (Why is that?)
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
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cited In (14)
- Artificial Evolution
- Algorithmes hybrides génériques pour la résolution de problèmes de satisfaction de contraintes
- Frontiers of Combining Systems
- Title not available (Why is that?)
- Multithreaded constraint programming: A hybrid approach
- Redundant modeling in permutation weighted constraint satisfaction problems
- Local Search and Constraint Programming
- Constraint Programming and Local Search Hybrids
- Title not available (Why is that?)
- A unified framework for partial and hybrid search methods in constraint programming
- A generic approach to combining stochastic algorithms with systematic constraint solvers
- MiningZinc: a declarative framework for constraint-based mining
- Heterogeneous constraint solving
- Methods and Applications of Artificial Intelligence
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)
