Parallelization Strategies for Rollout Algorithms (original) (raw)

Computational Optimization and Applications, 2005

Abstract

Rollout algorithms are innovative methods, recently proposed by Bertsekas et al. [3], for solving NP-hard combinatorial optimization problems. The main advantage of these approaches is related to their capability of magnifying the effectiveness of any given heuristic algorithm. However, one of the main limitations of rollout algorithms in solving large-scale problems is represented by their computational complexity. Innovative versions of

Francesca Guerriero hasn't uploaded this paper.

Let Francesca know you want this paper to be uploaded.

Ask for this paper to be uploaded.