论文信息 - Linear Programming Algorithms

Linear Programming Algorithms

Three types of algorithms for LINEAR PROGRAMMING had the most impact: the SIMPLEX ALGORITHM (see Section 3.2), interior point algorithms , and the ELLIPSOID METHOD .

Jens Vygen | Bernhard Korte

[1] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .

[2] P. Gács,et al. Khachiyan’s algorithm for linear programming , 1981 .

[3] Richard M. Karp,et al. On Linear Characterizations of Combinatorial Optimization Problems , 1982, SIAM J. Comput..

[4] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[5] Michael J. Todd,et al. Feature Article - The Ellipsoid Method: A Survey , 1981, Oper. Res..

[6] J. Edmonds. Systems of distinct representatives and linear algebra , 1967 .

[7] Pravin M. Vaidya,et al. A new algorithm for minimizing convex functions over convex sets , 1996, Math. Program..

[8] M. Padberg. Linear Optimization and Extensions , 1995 .

[9] András Frank,et al. An application of simultaneous diophantine approximation in combinatorial optimization , 1987, Comb..

[10] Éva Tardos,et al. A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs , 1986, Oper. Res..

[11] Alexander Schrijver,et al. Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[12] N. Z. Shor. Cut-off method with space extension in convex programming problems , 1977, Cybernetics.

[13] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..

[14] Michael J. Todd,et al. The Ellipsoid Method: A Survey , 1980 .