Integer programming by long division

Abstract We present a formal long-division algorithm for solving the well-known group minimisation problem. In fact, given some group elements with associated positive costs, the algorithm produces a listing of all products of these elements, in ascending order of total cost. It may thus be applied to the solution of all-integer linear programs, by finding the cheapest solution to the group minimisation problem consistent with feasibility.