Hybrid algorithms in constraint programming. (English) Zbl 1176.68204
Azevedo, Francisco (ed.) et al., Recent advances in constraints. 11th annual ERCIM international workshop on constraint solving and constraint logic programming, CSCLP 2006, Caparia, Portugal, June 26–28, 2006. Revised selected and invited papers. Berlin: Springer (ISBN 978-3-540-73816-9/pbk). Lecture Notes in Computer Science 4651. Lecture Notes in Artificial Intelligence, 1-32 (2007).
Summary: This paper surveys hybrid algorithms from a constraint programming perspective. It introduces techniques used within a constructive search framework, such as propagation and linear relaxation, as well as techniques used in combination with search by repair.
For the entire collection see [Zbl 1129.68001].
For the entire collection see [Zbl 1129.68001].
MSC:
| 68T20 | Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) |
| 90C27 | Combinatorial optimization |
| 90C59 | Approximation methods and heuristics in mathematical programming |
