Pages that link to "Item:Q1609921"
From MaRDI portal
The following pages link to A tabu search approach to the constraint satisfaction problem as a general problem solver (Q1609921):
Displaying 16 items.
- Integer programming techniques for the nurse rostering problem (Q284423) (← links)
- A systematic two phase approach for the nurse rostering problem (Q439701) (← links)
- Essential particle swarm optimization queen with tabu search for MKP resolution (Q488403) (← links)
- The case for strategic oscillation (Q542006) (← links)
- Cyclic preference scheduling of nurses using a Lagrangian-based heuristic (Q880573) (← links)
- Nurse rostering problems -- a bibliographic survey. (Q1410304) (← links)
- Linear combinations of heuristics for examination timetabling (Q1761893) (← links)
- A decomposed metaheuristic approach for a real-world university timetabling problem (Q2378402) (← links)
- Preference scheduling for nurses using column generation (Q2387240) (← links)
- A graph-based hyper-heuristic for educational timetabling problems (Q2432892) (← links)
- A path relinking approach with ejection chains for the generalized assignment problem (Q2570155) (← links)
- Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List (Q2773172) (← links)
- Satisfiability by Maxwell-Boltzmann and Bose-Einstein Statistical Distributions (Q2828180) (← links)
- A personal perspective on problem solving by general purpose solvers (Q3566446) (← links)
- Layout optimization considering production uncertainty and routing flexibility (Q4671330) (← links)
- Multiple machine JIT scheduling: a tabu search approach (Q5428715) (← links)