Restart strategies in optimization: parallel and serial cases

DOI10.1016/j.parco.2010.08.004zbMath1211.68507MaRDI QIDQ632718

Panos M. Pardalos, Oleg V. Shylo, Timothy Middelkoop

Publication date: 25 March 2011

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.parco.2010.08.004

zbMATH Keywords

restart; Las Vegas algorithms; parallel optimization; super linear speedup

Mathematics Subject Classification ID

68W40: Analysis of algorithms

68W10: Parallel algorithms in computer science

68W20: Randomized algorithms

Related Items

Parallel metaheuristics: recent advances and new trends, Using sequential runtime distributions for the parallel speedup prediction of SAT local search, Restart strategies for GRASP with path-relinking heuristics, A mesh adaptive basin hopping method for the design of circular antenna arrays, Efficient use of parallelism in algorithmic parameter optimization applications

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal speedup of Las Vegas algorithms
• Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
• Optimization parallelizing for discrete programming problems
• Benchmarks for basic scheduling problems
• An advanced tabu search algorithm for the job shop problem
• Restart technology for solving discrete optimization problems