Since the 1970s, several authors have studied the structure of the set partitioning polytope and proposed adaptations of the simplex algorithm that find an optimal solution via a sequence of basic ...

This paper develops an algorithm for pure integer programming problems. It first transforms the integer programming problem to an algebraically equivalent Hermite canonical problem, and then employs ...

PROC NETFLOW solves network problems that can have side constraints. Certain algebraic features of networks are exploited by a specialized version of the Simplex method so that solution times are ...