This is a preview. Log in through your library . Abstract We consider the optimal stopping problem for g(Zn), where Zn, n = 1,2,..., is a homogeneous Markov sequence. An algorithm, called forward ...
We show that the combination of dynamic programming with partial-order decomposition algorithms enables us to solve sequencing problems in polynomial time for substantially larger classes of ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback