Pages that link to "Item:Q693145"
From MaRDI portal
The following pages link to Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms (Q693145):
Displayed 12 items.
- A hybrid biased random key genetic algorithm for the quadratic assignment problem (Q280940) (← links)
- A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks (Q312488) (← links)
- Effective metaheuristic algorithms for the minimum differential dispersion problem (Q1751715) (← links)
- A diversified tabu search approach for the open-pit mine production scheduling problem with metal uncertainty (Q1926975) (← links)
- \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms (Q2018872) (← links)
- Solving the traveling delivery person problem with limited computational time (Q2103948) (← links)
- Large-scale parallelism for constraint-based local search: the costas array case study (Q2342606) (← links)
- Hybridizations of GRASP with path relinking for the far from most string problem (Q2811940) (← links)
- Extending time‐to‐target plots to multiple instances (Q4624885) (← links)
- A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications (Q4918246) (← links)
- On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics (Q5214308) (← links)
- Using sequential runtime distributions for the parallel speedup prediction of SAT local search (Q5398300) (← links)