Average-Case Performance of Rollout Algorithms for Knapsack Problems
Rollout algorithms have demonstrated excellent performance on a variety of dynamic and discrete optimization problems. Interpreted as an approximate dynamic programming algorithm, a rollout algorithm estimates the value-to-go at each decision stage by simulating future events while following a heuri...
Main Authors: | Mastin, Andrew, Jaillet, Patrick |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Springer-Verlag
2015
|
Online Access: | http://hdl.handle.net/1721.1/100430 https://orcid.org/0000-0002-8585-6566 |
Similar Items
-
Knapsack problems: algorithms and computer implementations/
by: 211429 Martello, Silvano, et al.
Published: (1989) -
Knapsack problems : algorithms and computer implementations /
by: 211429 Martello, Silvano, et al.
Published: (1990) -
Rollout algorithms for stochastic scheduling problems
Published: (2003) -
Implementation of genetic algorithms in solving the knapsack problem /
by: 367992 Teoh, Beng Khoon
Published: (2001) -
Partitioning algorithms for a class of knapsack problems
by: Pierce, John F.
Published: (2009)