MathGroup Archive 1993

[Date Index] [Thread Index] [Author Index]

Search the Archive

RE:Dynamic programming


Levent  Kitis wrote
"Does anybody have a tested Mathematica function that can solve
multistage decision problems using Bellman's dynamic programming
method?"

Have you tried the shortest path algorithms in the 
DiscreteMath`Combinatorica` package?

Tapio

+-----------------------------------------------------------------------+
| Tapio Luttinen                      Tel. (work)    +358 (18) 752-4252 |
| TL Consulting Engineers Ltd.        Tel. (home)    +358 (18) 756-3332 |
| Kulmakatu 5                         Tel. (mobile)  +358 (49) 350-298  |
| 15140 Lahti                         Fax            +358 (18) 752-4253 |
| FINLAND                             E-mail 100013.2275 at compuserve.com |
+-----------------------------------------------------------------------+






  • Prev by Date: A.O. Allen's Queueing Notebook
  • Next by Date: ContourPlot3D vs PlotQuadricSurface
  • Previous by thread: A.O. Allen's Queueing Notebook
  • Next by thread: ContourPlot3D vs PlotQuadricSurface