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 (Contributor), Jaillet, Patrick (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Laboratory for Information and Decision Systems (Contributor) |
Format: | Article |
Language: | English |
Published: |
Springer-Verlag,
2015-12-18T15:07:17Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
An Improved Genetic Algorithm for Knapsack Problems
by: Kilincli Taskiran, Gamze
Published: (2010) -
Approximation algorithms for minimum knapsack problem
by: Islam, Mohammad Tauhidul, et al.
Published: (2011) -
Consider the average sales per unit area of genetic algorithms solve to the multi-level knapsack problem
by: Wei-Lun Dai, et al.
Published: (2015) -
DESIGN AND EXAMINATION OF ALGORITHMS FOR SOLVING THE KNAPSACK PROBLEM
by: S. Kantsedal, et al.
Published: (2015-07-01) -
Substantiation of a heuristic algorithm in the knapsack problem
by: Н.В. KHalipovа, et al.
Published: (2012-12-01)