IP Explorer enables branch and bound using the simplex method to be applied to an integer programming (IP) problem.
The strategy for branching is choosing the appropriate variable Xi which is closest to being the smallest integer but greater than Xi.
IP Explorer is of particular value for problems with 2 variables when the branching process can be interpreted graphically.
IP Explorer was designed by Julian Hall (Mathematics) and Yinhua Zhou, both of the University of Edinburgh. It was written by Yinhua Zhou.