Now showing items 1-3 of 3
A Pseudopolynomial Network Flow Formulation for Exact Knapsack Separation
The NP-complete separation problem for the knapsack polyhedron P is formulated as a side-constrained network flow problem with a pseudopolynomial number of vertices and edges. It is demonstrated that the primal polyhedron ...
Resolving Degeneracy in Linear Programs: Steepest Edge, Steepest Ascent, and Closest Ascent
While variants of the steepest edge pivoting rule are commonly used in linear programming codes they are not known to have the theoretically attractive property of avoiding an infinite sequence of pivots at points of ...