Developing Systems

Improving branch-and-bound type methods for discrete problems with Boolean variables

V. O. Groppen

Ordzhonikidze

Abstract: For solution of combinatorial problems with Boolean variables algorithms are proposed which are modifications of branch-and-bound type algorithms. The proposed procedures are proved to be more effective than «conventional» ones, as shown in solution of the «knapsack» problem.

UDC: 519.58


Received: 31.03.1977

 English version: Automation and Remote Control, 1978, 39:5, 708–713

Bibliographic databases:

•