This paper shows how branch-and-bound methods can be used to reduce storage and, possibly, computational requirements in discrete dynamic programs. Relaxations and fathoming criteria are used to ...

The branch-and-bound procedure is formulated in rather general terms and necessary conditions for the branching and bounding functions are precisely specified. Results include the standard properties ...