GPU-Based Multi-start Local Search Algorithms

Abstract

In practice, combinatorial optimization problems are complex and computationally time-intensive. Local search algorithms are powerful heuristics which allow to significantly reduce the computation time cost of the solution exploration space. In these algorithms, the multistart model may improve the quality and the robustness of the obtained solutions… (More)
DOI: 10.1007/978-3-642-25566-3_24

Topics

8 Figures and Tables

Slides referencing similar topics