Pages that link to "Item:Q1854753"
From MaRDI portal
The following pages link to Combining the scalability of local search with the pruning techniques of systematic search (Q1854753):
Displaying 13 items.
- Contraint-based combinators for local search (Q850450) (← links)
- A constraint-based local search backend for MiniZinc (Q890003) (← links)
- An effective local search for the maximum clique problem (Q1041822) (← links)
- Local search with a SAT oracle for combinatorial optimization (Q2233496) (← links)
- Hybrid metaheuristics for stochastic constraint programming (Q2342607) (← links)
- Automated reformulation of specifications by safe delay of constraints (Q2457622) (← links)
- Generalised graph colouring by a hybrid of local search and constraint programming (Q2467347) (← links)
- Exploiting relaxation in local search for LABS (Q2468767) (← links)
- Hybrid Metaheuristics: An Introduction (Q2950517) (← links)
- Switching among Solvers: Collaborative Algorithms with Parameter Control (Q3589750) (← links)
- About the choice of the variable to unassign in a decision repair algorithm (Q5710543) (← links)
- Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5891242) (← links)
- Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5925164) (← links)
