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

A new polynomial-time algorithm for linear programming

Narendra Karmarkar · COMBINATORICA · 1984 · 4.8K citations

Mathematical Programming, Engineering, Optimization Problem +7

Partitioning procedures for solving mixed-variables programming problems

J. F. Benders · Numerische Mathematik · 1962 · 3.8K citations

Mathematical Programming, Engineering, Mixed Integer Optimization +4

The Cutting-Plane Method for Solving Convex Programs

James E. Kelley · Journal of the Society for Industrial and Applied Mathematics · 1960 · 1.5K citations

Numerical Analysis, Mathematical Programming, Engineering +3

International Series of Numerical Mathematics

Eric G. Wagner · Mathematics of Computation · 1963 · 888 citations

Numerical Analysis, Pade Approximant, International Series +2

The Decomposition Algorithm for Linear Programs

George B. Dantzig, Philip Wolfe · Econometrica · 1961 · 748 citations

Mathematical Programming, Efficient Computational Solution, Engineering +13