We extend the algorithm of Galil and Giancarlo, which speeds up dynamic programming in the case of concave cost functions, such that a compact representation of all optimal solutions is computed. Compared to the GalilαGiancarlo algorithm our time bound grows only by a small constant factor. With a c
β¦ LIBER β¦
Dynamic optimization without dynamic programming
β Scribed by Gregory C. Chow
- Book ID
- 116117411
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 515 KB
- Volume
- 9
- Category
- Article
- ISSN
- 0264-9993
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Speeding Up Dynamic Programming without
β
Norbert Blum
π
Article
π
2000
π
Elsevier Science
π
English
β 317 KB
Engineering Optimization || Dynamic Prog
β
Rao, Singiresu S.
π
Article
π
2009
π
John Wiley & Sons, Inc.
π
English
β 911 KB
Technology/Engineering/Mechanical Helps you move from theory to optimizing engineering systems in almost any industry Now in its Fourth Edition, Professor Singiresu Rao's acclaimed text Engineering Optimization enables readers to quickly master and apply all the important optimization methods in u
Extension of dynamic programming to nons
β
Duan Li; Yacov Y. Haimes
π
Article
π
1991
π
Elsevier Science
π
English
β 354 KB
Generalized dynamic programming for mult
β
Robert L. Carraway; Thomas L. Morin; Herbert Moskowitz
π
Article
π
1990
π
Elsevier Science
π
English
β 907 KB
Dynamic programming and graph optimizati
β
T.C. Hu; J.D. Morgenthaler
π
Article
π
1994
π
Elsevier Science
π
English
β 508 KB
Dynamic programming processes within dyn
β
C.J Rose
π
Article
π
1969
π
Elsevier Science
π
English
β 623 KB