A new heuristic algorithm for general integer linear programming...

A new heuristic algorithm is proposed for solving general integer linear programming problems. In the algorithm, the objective function hyperplane is used as a cutting plane, and then by introducing a speclal set of assistant sets, an efficient heuristic