Back to search

Using an interior point method for the master problem in a decomposition approach

Data up to Jan 2025

Published1997
Citations25
References29

Total Citations Per Year

Abstract

References (29)

Matrix computations

1983 • 31,414 citations

Linear Programming and Extensions

1963 • 5,853 citations

A new polynomial-time algorithm for linear programming

1984 • 4,898 citations

Partitioning procedures for solving mixed-variables programming problems

1962 • 3,587 citations

Network Flows

2011 • 2,186 citations

Direct Methods for Sparse Matrices

2017 • 1,634 citations

The Cutting-Plane Method for Solving Convex Programs

1960 • 1,530 citations

International Series of Numerical Mathematics

1963 • 865 citations

The Decomposition Algorithm for Linear Programs

1961 • 754 citations

The Evolution of the Minimum Degree Ordering Algorithm

1989 • 384 citations

Path-Following Methods for Linear Programming

1992 • 345 citations

Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art

1994 • 302 citations

Multiple centrality corrections in a primal-dual method for linear programming

1996 • 247 citations

Two-Metric Projection Methods for Constrained Optimization

1984 • 235 citations

Decomposition and Nondifferentiable Optimization with the Projective Algorithm

1992 • 203 citations

A polynomial newton method for linear programming

1986 • 138 citations

Advances in Linear and Integer Programming

1996 • 137 citations

A central cutting plane algorithm for the convex programming problem

1975 • 129 citations

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

1997 • 121 citations

Computing Block-Angular Karmarkar Projections with Applications to Stochastic Programming

1988 • 107 citations

Multicommodity network flows: The impact of formulation on decomposition

1993 • 106 citations

New Algorithms in Convex Programming Based on a Notion of “Centre” (for Systems of Analytic Inequalities) and on Rational Extrapolation

1988 • 74 citations

Primal-dual target-following algorithms for linear programming

1996 • 47 citations

Using central prices in the decomposition of linear programs

1993 • 34 citations

Exploiting special structure in Karmarkar's linear programming algorithm

1988 • 27 citations

Exploiting special structure in a primal—dual path-following algorithm

1993 • 25 citations

Implementing cholesky factorization for interior point methods of linear programming

1993 • 14 citations

Exploiting Special Structure in Primal Dual Interior Point Methods

1992 • 8 citations

Interior point methods

1996 • 6 citations

Cited By (0)

Loading...