Rollout algorithms for discrete optimization: A survey

Research output: Chapter in Book/Report/Conference proceedingChapter

35 Scopus citations


This chapter discusses rollout algorithms, a sequential approach to optimization problems, whereby the optimization variables are optimized one after the other. A rollout algorithm starts from some given heuristic and constructs another heuristic with better performance than the original. The method is particularly simple to implement and is often surprisingly effective. This chapter explains the method and its properties for discrete deterministic optimization problems.

Original languageEnglish (US)
Title of host publicationHandbook of Combinatorial Optimization
PublisherSpringer New York
Number of pages25
ISBN (Electronic)9781441979971
ISBN (Print)9781441979964
StatePublished - Jan 1 2013
Externally publishedYes

ASJC Scopus subject areas

  • General Mathematics


Dive into the research topics of 'Rollout algorithms for discrete optimization: A survey'. Together they form a unique fingerprint.

Cite this