Pages that link to "Item:Q5888195"
From MaRDI portal
The following pages link to An Improved Tabu Search Method For The Weighted Constraint Satisfaction Problem (Q5888195):
Displaying 6 items.
- Effective learning hyper-heuristics for the course timetabling problem (Q296691) (← links)
- Fast machine reassignment (Q338866) (← links)
- Using tabu search with longer-term memory and relaxation to create examination timetables. (Q1417490) (← links)
- Relaxation heuristics for the set multicover problem with generalized upper bound constraints (Q1652583) (← links)
- Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs (Q1695015) (← links)
- A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem (Q2386217) (← links)
