Nondeterministic control for hybrid search
From MaRDI portal
Publication:857891
DOI10.1007/s10601-006-9005-5zbMath1112.68039MaRDI QIDQ857891
Laurent Michel, Pascal Van Hentenryck
Publication date: 5 January 2007
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-006-9005-5
checkpoint; solution; local search; continuation; nondeterminism; closure; hybrid search; constraint language; search procedure
68P10: Searching and sorting
Related Items
Search combinators, Redundant modeling in permutation weighted constraint satisfaction problems, \textsc{Tor}: modular search with hookable disjunction, Bound-consistent spread constraint. Application to load balancing in nurse-to-patient assignments, Monadic constraint programming
Uses Software
Cites Work
- Control abstractions for local search
- SALSA: a language for search algorithms
- A unified framework for partial and hybrid search methods in constraint programming
- Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Search and strategies in OPL
- Principles and Practice of Constraint Programming – CP 2004
- Using constraint-based operators to solve the vehicle routing problem with time windows
