The following pages link to Parallel local search (Q1922627):
Displaying 16 items.
- Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms (Q693145) (← links)
- Metaheuristics in combinatorial optimization (Q817206) (← links)
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Large-scale parallelism for constraint-based local search: the costas array case study (Q2342606) (← links)
- TTT plots: a perl program to create time-to-target plots (Q2468777) (← links)
- A first multilevel cooperative algorithm for capacitated multicommodity network design (Q2489307) (← links)
- An empirical investigation on parallelization strategies for scatter search (Q2570149) (← links)
- A hybrid genetic algorithm based on a two-level hypervolume contribution measure selection strategy for bi-objective flexible job shop problem (Q2669753) (← links)
- Parallelization strategies for bee colony optimization based on message passing communication protocol (Q2868923) (← links)
- A study on diversity and cooperation in a multiagent strategy for dynamic optimization problems (Q3497738) (← links)
- Parallel Solution Methods for Vehicle Routing Problems (Q3564355) (← links)
- A review of literature on parallel constraint solving (Q4559826) (← links)
- Using sequential runtime distributions for the parallel speedup prediction of SAT local search (Q5398300) (← 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)
