|
Avtomatika i Telemekhanika, 1989, Issue 2, Pages 131–141
(Mi at6209)
|
|
|
|
Developing Systems
Designing a range of transport networks by the method of dynamic programming
D. T. Lotarev Moscow
Abstract:
A transport network has to connect a specified set of drains with the source. The network is allowed to branch only in the source and drain points and the dependence of the cost of a network element on the flow through it is unknown in advance. A dynamic programming algorithm is proposed whereby the cost determination is an element are operation. When the cost depends linearly on the flow, a branch-and-bound algorithm of dynamic programming is used.
Received: 14.07.1987
Citation:
D. T. Lotarev, “Designing a range of transport networks by the method of dynamic programming”, Avtomat. i Telemekh., 1989, no. 2, 131–141; Autom. Remote Control, 50:2 (1989), 233–240
Linking options:
https://www.mathnet.ru/eng/at6209 https://www.mathnet.ru/eng/at/y1989/i2/p131
|
Statistics & downloads: |
Abstract page: | 102 | Full-text PDF : | 51 | First page: | 2 |
|