Linear Programming

Linear Programming (1991)

Cached

Download Links

[theory.stanford.edu]

by Nimrod Megiddo

Venue:	FOR THE ENCYCLOPEDIA OF MICROCOMPUTERS
Citations:	5 - 0 self

BibTeX

@MISC{Megiddo91linearprogramming,
    author = {Nimrod Megiddo},
    title = {Linear Programming },
    year = {1991}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

2172	The Design and Analysis of Computer Algorithms - Aho, Hopcroft, et al. - 1974
969	Geometric algorithms and combinatorial optimization - Grötschel, Lovász, et al. - 1993
638	Linear Programming and Extensions - Dantzig - 1963
306	A polynomial algorithm in linear programming, Doklady Akad - Khachiyan - 1979
228	Convex Polytopes - Grunbaum - 1967
177	Small-dimensional linear programming and convex hulls made easy - Seidel - 1991
168	Linear programming in linear time when the dimension is fixed - Megiddo - 1984
156	Interior path-following primal-dual algorithms. Part II: Convex quadratic programs - Monteiro, Adler - 1989
138	How good is the simplex algorithm - Klee, Minty - 1969
134	Pathways to the optimal set in linear programming - Megiddo - 1989
131	A Unified Approach to Interior Point Algorithms for Linear Complimentarity Problems - Kojima, Meggido, et al. - 1991
112	Theory of Linear and - Schrijver - 1986
106	A polynomial-time algorithm, based on newton’s method, for linear programming - Renegar - 1988
92	Las Vegas Algorithms for Linear and Integer Programming When the Dimension is - Clarkson - 1995
91	A strongly polynomial algorithm to solve combinatorial linear programs - Tardos - 1986
84	Iterative solution of problems of linear and quadratic programming - Dikin - 1967
83	A combinatorial bound for linear programming and related problems - Sharir, Welzl - 1992
72	A polynomial-time algorithm for a class of linear complementarity problems - Kojima, Mizuno, et al. - 1989
60	An O(n L) potential reduction algorithm for linear programming - Ye - 1991
58	On a Multidimensional Search Technique and its Application to the Euclidean One-Center Problem," Department of Mathematics and Statistics, Teesside Polytechnic, manuscript - Dyer - 1985
57	On Projected Newton Barrier Methods for Linear Programming and an Equivalence to Karmarkar's Projective Method - Murray, Saunders, et al. - 1986
51	A variation of Karmarkar's algorithm for solving linear programming problems - Barnes - 1986
51	An `analytic center' for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming - Sonnevend - 1985
48	Simple and fast algorithms for linear and integer programs with two variables per inequality - Hochbaum, Naor
46	A modification of karmarkar’s linear programming algorithm - Vanderbei, Meketon, et al. - 1986
45	The ellipsoid method: A survey - Bland, Goldfarb, et al. - 1981
42	The Simplex Method: A Probabilistic Analysis, volume 1 of Algorithms and Combinatorics - Borgwardt - 1987
40	Kleitman D.: A quasi-polynomial bound for the diameter of graphs of polyhedra - Kalai - 1992
37	New finite pivoting rules for the simplex method - Bland - 1977
29	A simplex algorithm whose average number of steps is bounded between two quadratic functions of the smaller dimension - Adler, Megiddo - 1985
29	Towards a Genuinely Polynomial Algorithm for Linear Programming - Megiddo - 1983
28	On the average number of steps of the simplex method of linear programming - Smale - 1983
26	Improved algorithms for linear inequalities with two variables per inequality - Cohen, Megiddo - 1991
25	An algorithm for solving linear programming problems in O(n L) operations - Gonzaga
25	Speeding-up linear programming using fast matrix multiplication - Vaidya - 1989
20	Polynomial expected behavior of a pivoting algorithm for linear complementarity and linear programming problems - Todd - 1986
16	Utilization of the operation of space dilatation in the minimization of convex functions - Shor - 1970
15	Parallel linear programming in fixed dimension almost surely in constant time - Alon, Megiddo - 1990
15	Polynomial affine algorithms for linear programming - Gonzaga - 1990
10	Linear programming in O(n3 d ) time - Clarkson - 1986
4	A new polynomial algorithm for linear programming - Karmarkar - 1984
1	A simplex variant solving an m \Theta d linear program in O(min(m ; d )) expected number of steps - Adler, Karp, et al. - 1987
1	A subexponentioal randomized simplex algorithm," unpublished manuscript - Kalai - 1991
1	Eds., "Mathematical Developments Arising from Linear Programming - Lagarias, Todd - 1990
1	New Approaches to Linear Programming," Algorithmica 1 - Megiddo, Ed - 1986
1	On the complexity of linear programming," in: Advances in economic theory Fifth world - Megiddo - 1987
1	Linear programming (1986 - Megiddo - 1987