Back to search

Total Citations Per Year

Abstract

References (30)

Geometric Algorithms and Combinatorial Optimization

1988 • 3,622 citations

A polynomial-time algorithm, based on Newton's method, for linear programming

1988 • 587 citations

Theory and algorithms for linear optimization : an interior point approach

1997 • 522 citations

An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming

2006 • 359 citations

Interior Point Approach to Linear, Quadratic and Convex Programming: Algorithms and Complexity

1994 • 216 citations

A cutting plane algorithm for convex programming that uses analytic centers

1995 • 154 citations

A new algorithm for minimizing convex functions over convex sets

1996 • 151 citations

A central cutting plane algorithm for the convex programming problem

1975 • 129 citations

Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems

1996 • 126 citations

Solving nonlinear multicommodity flow problems by the analytic center cutting plane method

1997 • 121 citations

A quadratically convergent O( $$\sqrt n $$ L)-iteration algorithm for linear programming

1993 • 108 citations

On Finding Primal- and Dual-Optimal Bases

1991 • 100 citations

Warm start of the primal-dual method applied in the cutting-plane scheme

1998 • 94 citations

On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms

1992 • 87 citations

A cutting plane method from analytic centers for stochastic programming

1995 • 79 citations

Solving Linear Ordering Problems with a Combined Interior Point/Simplex Cutting Plane Algorithm

2000 • 76 citations

A Potential Reduction Algorithm Allowing Column Generation

1992 • 73 citations

Computational Experience with an Interior Point Cutting Plane Algorithm

2000 • 70 citations

Complexity analysis of the analytic center cutting plane method that uses multiple cuts

1996 • 58 citations

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

1996 • 56 citations

Multiple Cuts in the Analytic Center Cutting Plane Method

2000 • 47 citations

A Feasible BFGS Interior Point Algorithm for Solving Convex Minimization Problems

2000 • 47 citations

A Locally Weil-Behaved Potential Function and a Simple Newton-Type Method for Finding the Center of a Polytope

1989 • 33 citations

A logarithmic barrier cutting plane method for convex programming

1995 • 28 citations

Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming

1999 • 22 citations

Analysis of a Cutting Plane Method That Uses Weighted Analytic Center and Multiple Cuts

1997 • 21 citations

A build-up variant of the logarithmic barrier method for LP

1992 • 18 citations

Adding and Deleting Constraints in the Logarithmic Barrier Method for LP

1994 • 16 citations

Logarithmic barrier decomposition methods for semi-infinite programming

1997 • 16 citations

An Interior Point Cutting Plane Algorithm for Ising Spin Glass Problems

1998 • 8 citations

Cited By (0)

Loading...