Control abstractions for local search
From MaRDI portal
Publication:816678
DOI10.1007/s10601-005-0553-xzbMath1084.68033OpenAlexW2065742269MaRDI QIDQ816678
Laurent Michel, Pascal Van Hentenryck
Publication date: 23 February 2006
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-005-0553-x
Searching and sorting (68P10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (5)
Contraint-based combinators for local search ⋮ Nondeterministic control for hybrid search ⋮ Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings ⋮ A branch‐and‐price approach to k‐clustering minimum biclique completion problem ⋮ Control abstractions for local search
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Control abstractions for local search
- Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
- Improved local search for CP toolkits
- Optimization software class libraries
- SALSA: a language for search algorithms
- A general approach for constraint solving by local search
- Localizer
- Applying tabu search to the job-shop scheduling problem
- Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- An Efficient Heuristic Procedure for Partitioning Graphs
- A Fast Taboo Search Algorithm for the Job Shop Problem
- A decomposition-based implementation of search strategies
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Constraint-based agents. An architecture for constraint-based modeling and local-search-based reasoning for planning and scheduling in open and dynamic worlds
- Solving vehicle routing problems using constraint programming and metaheuristics
This page was built for publication: Control abstractions for local search
