Pages that link to "Item:Q1876601"
From MaRDI portal
The following pages link to A general approach for constraint solving by local search (Q1876601):
Displaying 9 items.
- A tabu search algorithm for the covering design problem (Q415558) (← links)
- The case for strategic oscillation (Q542006) (← links)
- Control abstractions for local search (Q816678) (← links)
- Maintaining longest paths incrementally (Q816679) (← links)
- Multicriteria models for planning power-networking events (Q992580) (← links)
- Integrating domain and constraint privacy reasoning in the distributed stochastic algorithm with breakouts (Q2075368) (← links)
- Modeling the Costas array problem in QUBO for quantum annealing (Q2163794) (← links)
- Large-scale parallelism for constraint-based local search: the costas array case study (Q2342606) (← links)
- Generic incremental algorithms for local search (Q2385177) (← links)
