The following pages link to (Q4434988):
Displaying 10 items.
- Hybrid variable neighbourhood approaches to university exam timetabling (Q976395) (← links)
- Analysis of new variable selection methods for discriminant analysis (Q1010495) (← links)
- The double traveling salesman problem with multiple stacks: A variable neighborhood search approach (Q1025245) (← links)
- A variable neighborhood search heuristic for the maximum ratio clique problem (Q1652431) (← links)
- A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation (Q2003563) (← links)
- New formulations for the Kissing Number Problem (Q2383541) (← links)
- MPI parallelization of variable neighborhood search (Q2840781) (← links)
- (Q3115689) (← links)
- Application of parallel heuristic algorithms for speeding up parallel implementations of the branch-and-bound method (Q6123149) (← links)
- A new taxonomy of global optimization algorithms (Q6137180) (← links)