Contraint-based combinators for local search
From MaRDI portal
Publication:850450
DOI10.1007/s10601-005-2811-3zbMath1102.68460OpenAlexW2017930865MaRDI QIDQ850450
Laurent Michel, Liyuan Liu, Pascal Van Hentenryck
Publication date: 3 November 2006
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-005-2811-3
local searchconstraints languangedifferential objectsfirst-class expressionslogical and cardinality combinatorsreificationsearch procedure
Related Items
Constraint-based very large-scale neighborhood search, A microkernel architecture for constraint programming, A branch‐and‐price approach to k‐clustering minimum biclique completion problem
Uses Software
Cites Work
- Unnamed Item
- A simple tabu search for warehouse location
- Control abstractions for local search
- Improving linear constraint propagation by changing constraint representation
- Improved local search for CP toolkits
- Combining the scalability of local search with the pruning techniques of systematic search
- Negative effects of modeling techniques on search performance
- Optimization software class libraries
- SALSA: a language for search algorithms
- Bounded incremental computation
- Localizer
- Applying tabu search to the job-shop scheduling problem
- On global warming: Flow-based soft global constraints
- Constraint and Integer Programming in OPL
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- Scheduling Social Golfers Locally
- Constraint-based agents. An architecture for constraint-based modeling and local-search-based reasoning for planning and scheduling in open and dynamic worlds
