ACCPM — A library for convex optimization based on an analytic center cutting plane method

This publication has 8 references indexed in Scilit:

• A cutting plane method from analytic centers for stochastic programming
  Mathematical Programming, 1995
• Experimental behavior of an interior point cutting plane algorithm for convex programming: an application to geometric programming
  Discrete Applied Mathematics, 1994
• Using central prices in the decomposition of linear programs
  European Journal of Operational Research, 1993
• Implementing cholesky factorization for interior point methods of linear programming
  Optimization, 1993
• Decomposition and Nondifferentiable Optimization with the Projective Algorithm
  Management Science, 1992
• Cutting planes and column generation techniques with the projective algorithm
  Journal of Optimization Theory and Applications, 1990
• A polynomial newton method for linear programming
  Algorithmica, 1986
• The Decomposition Algorithm for Linear Programs
  Econometrica, 1961