|
Avtomatika i Telemekhanika, 1982, Issue 4, Pages 72–77
(Mi at5498)
|
|
|
|
Developing Systems
An algorithm for reducing search for solutions in a network scheduling theory problem
S. A. Kantsedal Char'kov
Abstract:
To solve a problem of the scheduling theory whose initial data are structured in a network, the algorithm identifies a subset t with an optimal solution to the problem of the minimal cardinality which depends on the structure of the initial data and their numerical values.
Received: 25.11.1980
Citation:
S. A. Kantsedal, “An algorithm for reducing search for solutions in a network scheduling theory problem”, Avtomat. i Telemekh., 1982, no. 4, 72–77; Autom. Remote Control, 43:4 (1982), 485–490
Linking options:
https://www.mathnet.ru/eng/at5498 https://www.mathnet.ru/eng/at/y1982/i4/p72
|
Statistics & downloads: |
Abstract page: | 104 | Full-text PDF : | 58 | First page: | 1 |
|