Generic incremental algorithms for local search
DOI10.1007/S10601-007-9021-0zbMATH Open1211.68374DBLPjournals/constraints/AgrenFP07OpenAlexW2076720427WikidataQ57574279 ScholiaQ57574279MaRDI QIDQ2385177FDOQ2385177
Authors: Magnus Ågren, Pierre Flener, Justin Pearson 
Publication date: 11 October 2007
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-007-9021-0
Recommendations
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic in computer science (03B70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bandwidth Packing: A Tabu Search Approach
- Interval propagation to reason about sets: Definition and implementation of a practical language
- A general approach for constraint solving by local search
- Title not available (Why is that?)
- Parallel Local Search in Comet
- Integer optimization by local search. A domain-independent approach
- Principles and Practice of Constraint Programming – CP 2004
- Differentiable Invariants
- 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
- Localizer: A Modeling Language for Local Search
Cited In (4)
Uses Software
This page was built for publication: Generic incremental algorithms for local search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2385177)
