Integer Programming Problems for Which a Simple Rounding Type Algorithm Works

In a remarkable paper, Bartholdi, Orlin and Ratliff solve a special case of integer programs by a very simple algorithm. Their idea is first to solve the corresponding linear program and from the resulting solution obtain an optimal solution to the integer program by doing a simple transformation. In this paper we study the conditions under which such a method can be applied.