Letter to the Editor—An Extension of the Algorithm of Driebeek for Solving Mixed Integer Programming Problems

Abstract

A modification of the branch-and-bound algorithm due to Norman Driebeek for the solution of mixed integer programming problems is discussed. This modification increases the over-all efficiency of the algorithm. In addition, the modified algorithm is capable of solving, without reformulation, the more general problem in which i the allowable values for the restricted variables are not integers or are not evenly spaced. The algorithm has been coded in FORTRAN and tested on a Honeywell H-1800 computer.