AN APPROACH FOR THE OPTIMAL SOLUTION OF MILP PROBLEMS

摘要

This paper describes an algorithm for finding solutions to optimization problems in which some of the variables must take integer values. The solution of discrete optimization problem to optimality is often an immense job requiring very efficient algorithm. In this paper we describe a Branch and Bound algorithm to solve MILP problems.