Rollout algorithms for discrete optimization: A survey

Dimitri P. Bertsekas

doi:10.1007/978-1-4419-7997-1_8

Rollout algorithms for discrete optimization: A survey

Dimitri P. Bertsekas

Research output: Chapter in Book/Report/Conference proceeding › Chapter

35 Scopus citations

Abstract

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 language	English (US)
Title of host publication	Handbook of Combinatorial Optimization
Publisher	Springer New York
Pages	2989-3013
Number of pages	25
Volume	5-5
ISBN (Electronic)	9781441979971
ISBN (Print)	9781441979964
DOIs	https://doi.org/10.1007/978-1-4419-7997-1_8
State	Published - Jan 1 2013
Externally published	Yes

ASJC Scopus subject areas

General Mathematics

Access to Document

10.1007/978-1-4419-7997-1_8

Cite this

@inbook{ee6caad5cf93403f8e5d109f12a87c40,

title = "Rollout algorithms for discrete optimization: A survey",

abstract = "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.",

author = "Bertsekas, {Dimitri P.}",

year = "2013",

month = jan,

day = "1",

doi = "10.1007/978-1-4419-7997-1_8",

language = "English (US)",

isbn = "9781441979964",

volume = "5-5",

pages = "2989--3013",

booktitle = "Handbook of Combinatorial Optimization",

publisher = "Springer New York",

}

TY - CHAP

T1 - Rollout algorithms for discrete optimization

T2 - A survey

AU - Bertsekas, Dimitri P.

PY - 2013/1/1

Y1 - 2013/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85003740908&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85003740908&partnerID=8YFLogxK

U2 - 10.1007/978-1-4419-7997-1_8

DO - 10.1007/978-1-4419-7997-1_8

M3 - Chapter

AN - SCOPUS:85003740908

SN - 9781441979964

VL - 5-5

SP - 2989

EP - 3013

BT - Handbook of Combinatorial Optimization

PB - Springer New York

ER -

Rollout algorithms for discrete optimization: A survey

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this