Pages that link to "Item:Q850450"
From MaRDI portal
The following pages link to Contraint-based combinators for local search (Q850450):
Displaying 15 items.
- Constraint-based very large-scale neighborhood search (Q434452) (← links)
- Bounding, filtering and diversification in CP-based local branching (Q519096) (← links)
- Control abstractions for local search (Q816678) (← links)
- Non-local configuration of component interfaces by constraint satisfaction (Q823765) (← links)
- A constraint-based local search backend for MiniZinc (Q890003) (← links)
- A microkernel architecture for constraint programming (Q1706769) (← links)
- SALSA: a language for search algorithms (Q1871967) (← links)
- A general approach for constraint solving by local search (Q1876601) (← links)
- Localizer (Q1975204) (← links)
- Generic support for precomputation-based global routing constraints in local search optimization (Q2093926) (← links)
- Constraint Programming and Local Search Hybrids (Q3064565) (← links)
- (Q4738481) (← links)
- A branch‐and‐price approach to <i>k</i>‐clustering minimum biclique completion problem (Q4921257) (← links)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Q5713882) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900284) (← links)