|
Avtomatika i Telemekhanika, 1986, Issue 5, Pages 91–101
(Mi at6271)
|
|
|
|
Developing Systems
Decomposition of the allocation problem
B. I. Gol'dengorin Alma-Ata
Abstract:
The chief advantage of the proposed algorithm for decomposition of allocation problems, APs is that, in addition to the usual branching in branch-and-bound operations, it helps prove polynomial solvability of new ranges of APs and expanding the known polynomially solvable particular cases of APs.
Received: 24.04.1985
Citation:
B. I. Gol'dengorin, “Decomposition of the allocation problem”, Avtomat. i Telemekh., 1986, no. 5, 91–101; Autom. Remote Control, 47:5 (1986), 668–677
Linking options:
https://www.mathnet.ru/eng/at6271 https://www.mathnet.ru/eng/at/y1986/i5/p91
|
Statistics & downloads: |
Abstract page: | 125 | Full-text PDF : | 63 |
|