Back to search

Total Citations Per Year

Abstract

References (21)

A new polynomial-time algorithm for linear programming

1984 • 4,898 citations

Partitioning procedures for solving mixed-variables programming problems

1962 • 3,587 citations

Lapack Users' Guide

1995 • 2,302 citations

Problem complexity and method efficiency in optimization

1984 • 1,542 citations

The Cutting-Plane Method for Solving Convex Programs

1960 • 1,530 citations

The Decomposition Algorithm for Linear Programs

1961 • 754 citations

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

1988 • 587 citations

Path-Following Methods for Linear Programming

1992 • 345 citations

Two-Metric Projection Methods for Constrained Optimization

1984 • 235 citations

Decomposition and Nondifferentiable Optimization with the Projective Algorithm

1992 • 203 citations

A cutting plane algorithm for convex programming that uses analytic centers

1995 • 154 citations

An extension of Karmarkar's algorithm for linear programming using dual variables

1986 • 153 citations

A polynomial newton method for linear programming

1986 • 138 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

Complexity estimates of some cutting plane methods based on the analytic barrier

1995 • 97 citations

A cutting plane method from analytic centers for stochastic programming

1995 • 79 citations

Cutting planes and column generation techniques with the projective algorithm

1990 • 67 citations

On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm

1993 • 59 citations

Experimental behavior of an interior point cutting plane algorithm for convex programming: an application to geometric programming

1994 • 49 citations

Survivability in Telecommunication Networks

1995 • 12 citations

Cited By (0)

Loading...