Abstract
This note reports on a method for solving the general integer linear programming problem that is called the Bounded Variable Algorithm. It first describes the basic algorithm and then makes a comparison of limited scope between the Bounded Variable Algorithm and other published algorithms on a set of common problems.

This publication has 0 references indexed in Scilit: