|
114
|
Interior-Point Methods for Linear Programming
– I J Lustig, R Marsten, D F Shanno
- 1994
|
|
539
|
A NEW POLYNOMIAL-TIME ALGORITHM FOR LINEAR PROGRAMMING
– N. Karmarkar
- 1984
|
|
22
|
The Use of the Optimal Partition in a Linear Programming Solution for Postoptimal Analysis
– H J Greenberg
- 1993
|
|
224
|
On the implementation of a primal-dual interior point method
– S Mehrotra
- 1992
|
|
163
|
Monotonicity of primal-dual interior-point algorithms for semidefinite programming problems
– Masakazu Kojima, Levent Tuncel
- 1998
|
|
45
|
On the finite convergence of interior-point algorithms for linear programming
– Y Ye
- 1992
|
|
6
|
New purification algorithms for linear programming
– K O KORTANEK, J S ZHU
- 1988
|
|
35
|
Progress in linear programming
– R E Bixby
- 1994
|
|
83
|
On Implementing Mehrotra's PredictorCorrector Interior Point Method for Linear Programming
– I J Lustig, R E Marsten, D F Shanno
- 1992
|
|
638
|
Linear Programming and Extensions
– G B Dantzig
- 1963
|
|
5
|
An opposite sign algorithm for purification to an extreme point solution
– A Charnes, K O Kortanek
- 1963
|
|
38
|
Theory of linear programming
– A J GOLDMAN, A W TUCKER
- 1956
|
|
70
|
Computational Experience with a Primaldual Interior Point Method for Linear Programming
– I J Lustig, R E Marsten, D F Shanno
- 1989
|
|
1233
|
Theory of linear and integer programming
– A Schrijver
- 1986
|
|
16
|
Combining interior-point and pivoting algorithms for linear programming
– Erling D. Andersen , Yinyu Ye
- 1995
|
|
33
|
Very Large-Scale Linear Programming: A Case Study
– R Bixby, J Gregory, I Lustig, R Marsten, D Shanno
- 1991
|
|
14
|
A build-up variant of the path-following method for LP
– C Roos, D. Den Hertog, C. Roos, T. Terlaky, T. Terlaky
- 1991
|
|
52
|
Solving combinatorial optimization problems using Karmarkar’s algorithm
– J E Mitchell, M J Todd
- 1992
|
|
134
|
Pathways to the optimal set in linear programming
– N Megiddo
- 1989
|
