Generic incremental algorithms for local search
From MaRDI portal
Publication:2385177
Recommendations
Cites work
- scientific article; zbMATH DE number 1696811 (Why is no real title available?)
- scientific article; zbMATH DE number 1302020 (Why is no real title available?)
- scientific article; zbMATH DE number 1016966 (Why is no real title available?)
- A general approach for constraint solving by local search
- Bandwidth Packing: A Tabu Search Approach
- Differentiable Invariants
- Generating Propagators for Finite Set Constraints
- Incremental Algorithms for Local Search from Existential Second-Order Logic
- Inferring Variable Conflicts for Local Search
- Integer optimization by local search. A domain-independent approach
- Interval propagation to reason about sets: Definition and implementation of a practical language
- Localizer: A Modeling Language for Local Search
- Parallel Local Search in Comet
- Principles and Practice of Constraint Programming – CP 2004
- Set Variables and Local Search
- Using global constraints for local search
Cited in
(4)
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)