Avtomat. i Telemekh., 1989 Issue 5, Pages 112–119
(Mi at6287)
|
This article is cited 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.
UDC:
65.012.122:519.854.64
Received: 05.01.1988
English version:
Automation and Remote Control, 1989,
50:5,
666–672
Bibliographic databases:
© , 2024
Fulltext:
PDF file (960 kB)