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

Paul R. Rebelein
Additional contact information
Paul R. Rebelein: Honeywell Inc., Minneapolis, Minnesota

Operations Research, 1968, vol. 16, issue 1, 193-198

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.

Date: 1968
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.16.1.193 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:16:y:1968:i:1:p:193-198

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().