Abstract
The solution of some constrained combinatorial optimization problems encountered in the preinvestment planning of large-scale water resources systems is discussed. Mathematical structures are formulated for several problems involving the optimal selection, sequencing and timing of a set of water resources development projects which, in the aggregate, must satisfy a number of continuous time demand projections at every point in a finite planning horizon. An overview of four different solution techniques is also given. Specifically, myopic decision rules, integer programming formulations, and both implicit enumeration by branch-and-bound algorithms and dynamic programming algorithms are discussed. A computational comparison of these solution techniques on a number of real-world water resources problems of various sizes is also reported.

This publication has 12 references indexed in Scilit: