An Algorithm for Integer Linear Programming by Parametric Modification of an Added Constraint

摘要

To solve an integer linear program, we identify particular values that the objective function can assume on feasible lattice points. Thus, we reduce the problem of finding an optimal integer solution of n dimensions to that of finding a feasible integer solution of n-1 dimensions. A Branch and Bound Method is presented to solve the latter problem for the 0-1 case. (Author)