Linear Programming:  Pivoting on . . .

Linear Programming: Pivoting on . . .

Cached

Download Links

[cgm.cs.mcgill.ca]

Other Repositories/Bibliography

DBLP

by Bohdan Lubomyr Kaluzny

BibTeX

@MISC{Kaluzny_linearprogramming:,
    author = {Bohdan Lubomyr Kaluzny},
    title = {Linear Programming: Pivoting on . . . },
    year = {}
}

Bookmark

OpenURL

Abstract

Citations

1231	Theory of Linear and Integer Programming - Schrijver - 1986
643	Algorithms in Combinatorial Geometry - Edelsbrunner - 1987
638	Linear Programming and Extensions - Dantzig - 1963
539	A new polynomial-time algorithm for linear programming, " Combinatorica 4 - Karmarkar - 1984
371	Combinatorial Optimization: Polyhedra and Efficiency - Schrijver - 2003
294	Lectures on Polytopes - Ziegler - 1995
148	A subexponential bound for linear programming, Algorithmica 16 - Matouˇsek, Sharir, et al. - 1996
138	How good is the simplex algorithm - Klee, Minty - 1969
129	The maximal number of faces of a convex polytope - McMullen - 1970
121	Reverse search for enumeration - Avis, Fukuda - 1996
121	Lectures on discrete geometry - Matoušek - 2002
116	facing up to arrangements: face-count formulas for partitions of space by hyperplanes - Zaslavsky - 1975
108	Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time - Spielman, Teng
100	A polynomial algorithm for linear programming - Khachian - 1979
87	A subexponential randomized simplex algorithm - Kalai - 1992
66	How good are convex hull algorithms - Avis, Bremner, et al. - 1997
46	Solving real-world linear programs: A decade and more of progress - Bixby - 2002
44	Symbolic treatment of geometric degeneracies - Yap - 1990
43	Linear Algebra and Its Applications, 3rd ed - Strang - 1988
42	The Simplex Method: A Probabilistic Analysis, volume 1 of Algorithms and Combinatorics - Borgwardt - 1987
42	The d-step conjecture and its relatives - Klee, Kleinschmidt - 1987
41	lrs: A Revised Implementation of the Reverse Search Vertex Enumeration Algorithm - Avis - 2000
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
28	Theorie der einfachen Ungleichungen - Farkas - 1901
27	Maximal flow through a network, Canad - Jr, Fulkerson - 1956
24	Deformed products and maximal shadows of polytopes - Amenta, Ziegler - 1999
24	The Hirsch conjecture is true for (0, 1)-polytopes - Naddef - 1989
21	Solution d'une question particuliere du calcul des inegalites, Nouveau Bulletin des Sciences par la Societe Philomatique de Paris, 1826, in [36] vol.2,317{319 - Fourier
21	Theoria Combinationis Observationum Erronbus Minimus Obnoxiae, in two parts and a supplement. Commentatines Societatis Regiae Scietiarum Gottingemis Recentiores - Gauss - 1995
21	A proof of the strict monotone 4-step conjecture - Holt, Klee - 1999
18	programming, the simplex algorithm and simple polytopes - Kalai, Linear - 1997
17	A combinatorial abstraction of linear programming - Bland - 1977
17	A Convergent Criss-Cross Method - Terlaky - 1985
16	Optimality and degeneracy in linear programming - Charnes - 1952
16	Computational complexity of parametric linear programming - Murty - 1980
15	Linear and Quadratic Programming in Oriented Matroids - Todd - 1985
14	2001), cddlib reference manual, cddlib Version 0.92 - Fukuda
14	and T.Terlaky, Criss-cross methods: A fresh view on pivot algorithms - Fukuda - 1997
13	A Conformal Elimination Free Algorithm for Oriented Matroid Programming - Wang - 1987
13	A technique for resolving degeneracy in linear programming - Wolfe - 1963
12	Duality theory of linear programs - a constructive approach with applications - Balinski, Tucker - 1969
12	Worst case complexity of the shadow vertex simplex algorithm - Goldfarb - 1983
12	An expiremental study of the simplex method - Kuhn, Quandt - 1963
12	Paths of polytopes - Larman - 1970
12	Linear Programs and Related Problems - Nering, Tucker - 1993
11	The monotone bounded Hirsch conjecture is false for dimension at least four - Todd - 1980
10	The criss-cross method for solving linear programming problems, Management Science 15(7 - Zionts - 1969
8	An exponential example for Terlaky’s pivoting rule for the criss-cross simplex method, Mathematical Programming 46 - Roos - 1990
7	Programming: An Introduction to Finite Improvement Algorithms - Solow, Linear - 1984