P. G'acs and L. Lov'asz. Khachiyan's algorithm for linear programming. Math. Program. Studies, 14:61--68, 1981. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Method of Centers for Minimizing Generalized Eigenvalues - Boyd, Ghaoui (1993) (41 citations) (Correct)
.... interior point method for linear programming [Dik67] Interest in interior point methods, mostly for lin1 ear and quadratic programs, surged in 1979 when Khachyian used the ellipsoid method developed by Shor, Nemirovsky, and Yudin to prove that linear programs can be solved in polynomial time [Kha79, GL81]. Interest surged again in 1984 when Karmarkar [Kar84] gave his interior point method for solving linear programs, which appears to have very good practical performance as well as a good worst case complexity bound. Since the publication of Karmarkar s paper, many researchers have studied ....
P. G'acs and L. Lov'asz. Khachiyan's algorithm for linear programming. Math. Program. Studies, 14:61--68, 1981.
Interval Graphs with Side Constraints - Pe'er (1995) (Correct)
....deciding whether system T or T is feasible. We shall prove now that a system S of weak and strict difference constraints on n variables is reducible in linear time to a system S 0 which consists of weak difference constraints, with numbers only O(n) larger. Standard transformation techniques [16] would give numbers O(2 L ) larger for binary input length L. Assume all constants in S to be integral, and fix ffl 1 n . Define S 0 to include every weak inequality x Gammay c in S, and a weak inequality x Gammay c Gammaffl for every strict inequality x Gammay c in S. Note that the ....
P. Gacs and L. Lovasz. Khachiyan's algorithm for linear programming. Math. Prog. Study, 14:61--68, 1981.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC