|
Zhurnal Vychislitel'noi Matematiki i Matematicheskoi Fiziki, 1979, Volume 19, Number 4, Pages 1059–1061
(Mi zvmmf5380)
|
|
|
|
Scientific communications
The use of the number of permissible solutions of the algorithmic equations for the purely integer linear programming problem
Ĭ. G. Mitev Sofiya, Bolgariya
Abstract:
A single algorithm is presented for the purely integer linear programming problem, in which the number and structure of the vectors to be selected are determined as a function of the distribution of the number of solutions of the equations forming the constraints of the problem. The possibility of using the number of solutions of the equations in algorithms of the branch and bound type as an additional cut-off mechanism is also described.
Received: 14.06.1978
Citation:
Ĭ. G. Mitev, “The use of the number of permissible solutions of the algorithmic equations for the purely integer linear programming problem”, Zh. Vychisl. Mat. Mat. Fiz., 19:4 (1979), 1059–1061; U.S.S.R. Comput. Math. Math. Phys., 19:4 (1979), 279–281
Linking options:
https://www.mathnet.ru/eng/zvmmf5380 https://www.mathnet.ru/eng/zvmmf/v19/i4/p1059
|
Statistics & downloads: |
Abstract page: | 154 | Full-text PDF : | 74 | First page: | 1 |
|