An algorithm, called forward improvement iteration, is presented by which an optimal stopping time can be computed. Using an iterative step, this algorithm computes a sequence B⁰ = Bⁱ = B2 =... of ...

Awi Federgruen, Michal Tzur, A Simple Forward Algorithm to Solve General Dynamic Lot Sizing Models with n Periods in 0(n $\\log$ n) or 0(n) Time, Management Science, Vol. 37, No. 8 (Aug., 1991), pp.

A new algorithm that fast forwards simulations could bring greater use ability to current and near-term quantum computers, opening the way for applications to run past strict time limits that ...