Survey of Integer Programming

Abstract

The paper surveys the progress that has been made with the problem of solving linear programming problems when some or all variables are required to take integer values. It is pointed out that there are now four distinct approaches capable of solving real problems of this type: cutting plane methods, primal methods, branch and bound methods, and partial enumeration methods. Each approach is explained briefly. A detailed bibliography is attached.