|
Avtomatika i Telemekhanika, 1989, Issue 5, Pages 112–119
(Mi at6287)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Developing Systems
A generalized siting problem
A. O. Alekseev, O. G. Alekseev, S. A. Vasil'kovskii Leningrad
Abstract:
A branch-and-bound algorithm is applied to solve a siting problem specified for a set of possible versions of factory siting.
Received: 05.01.1988
Citation:
A. O. Alekseev, O. G. Alekseev, S. A. Vasil'kovskii, “A generalized siting problem”, Avtomat. i Telemekh., 1989, no. 5, 112–119; Autom. Remote Control, 50:5 (1989), 666–672
Linking options:
https://www.mathnet.ru/eng/at6287 https://www.mathnet.ru/eng/at/y1989/i5/p112
|
Statistics & downloads: |
Abstract page: | 90 | Full-text PDF : | 42 | First page: | 2 |
|