Dynamic programming, successive approximations, and variational problems of combinatorial nature.

An attempt to show that a combination of dynamic programming and the classical method of successive approximations permits a systematic study of various classes of combinatorial problems arising in scheduling, communication, and network theory. Examp...