Мобильная версия

Доступно журналов:

3 288

Доступно статей:

3 891 637

 

Скрыть метаданые

Автор Morin, Thomas L.
Автор Esogbue, Augustine M. O.
Дата выпуска 1971
dc.description The sequencing and scheduling aspects of some important capacity expansion problems encountered in water resources development are studied. Dynamic programing algorithms are developed for both project timing problems and combined project selection and timing problems involving durable high cost water supply projects, which in the aggregate are subject to continuous time demand requirements. The structure of the problems is successfully exploited to produce computationally efficient algorithms to solve problems of the dimension encountered in water resources systems. The computational superiority of these algorithms over conventional dynamic programing algorithms is discussed and illustrated by a numerical example.
Формат application.pdf
Копирайт Copyright 1971 by the American Geophysical Union.
Название Some Efficient Dynamic Programing Algorithms for the Optimal Sequencing and Scheduling of Water Supply Projects
Тип article
DOI 10.1029/WR007i003p00479
Electronic ISSN 1944-7973
Print ISSN 0043-1397
Журнал Water Resources Research
Том 7
Первая страница 479
Последняя страница 484
Выпуск 3
Библиографическая ссылка Bellman, R. E., S. E.Dreyfus, Applied Dynamic Programming, 363, Princeton University Press, Princeton, New Jersey, 1962.
Библиографическая ссылка Butcher, W. S., Y. Y.Haimes, W. A.Hall, Dynamic programing for the optimal sequencing of water supply projects, Water Resour. Res., 56, 1196–1204, 1969.
Библиографическая ссылка Larson, R. E., State Increment Dynamic Programming, 256, American Elsevier, New York, 1968.

Скрыть метаданые