Revisiting constraint-directed search
DOI10.1016/J.IC.2008.12.001zbMATH Open1169.68046DBLPjournals/iandc/AgrenFP09OpenAlexW2069963179WikidataQ57574262 ScholiaQ57574262MaRDI QIDQ1013089FDOQ1013089
Authors: Magnus Ågren, Pierre Flener, Justin Pearson
Publication date: 16 April 2009
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2008.12.001
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70)
Cites Work
- Optimization by simulated annealing
- Title not available (Why is that?)
- Title not available (Why is that?)
- Integer optimization by local search. A domain-independent approach
- Title not available (Why is that?)
- Scheduling Social Golfers Locally
- Differentiable Invariants
- The island confinement method for reducing search space in local search methods
- Generic incremental algorithms for local search
- Using global constraints for local search
- Incremental Algorithms for Local Search from Existential Second-Order Logic
- Generating Propagators for Finite Set Constraints
- Inferring Variable Conflicts for Local Search
- Set Variables and Local Search
Cited In (5)
Uses Software
This page was built for publication: Revisiting constraint-directed search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1013089)