Developing Systems

On combined application of dynamic programming and the branch-and-bound method in integer programming problems

O. G. Alekseev, I. F. Volodos'

Leningrad

Abstract: The way to solve problems of discrete programming described in the paper simultaneously uses the dynamic programming and the branch-and-bound methods. The algorithm block-diagram and results of computer experiment are presented.

UDC: 519.283


Received: 17.07.1975

 English version: Automation and Remote Control, 1976, 37:4, 557–565

Bibliographic databases:

• 
•