4 records found
1
A long-step, cutting plane algorithm for linear and convex programming
A homogenized cutting plane method to solve the convex feasibility problem
Computational experience of an interior-point SQP algorithm in a parallel branch-and-bound framework
Solving linear ordering problems with a combined interior point/simplex cutting plane algorithm
