Using an interior point method in a branch and bound algorithm for integer programming July

This paper describes an experimental code that has been developed to solve zero one mixed integer linear programs The experimental code uses a primal dual interior point method to solve the linear programming subproblems that arise in the solution of mixed integer linear programs by the branch and bound method Computational results for a number of test problems are provided