Linear programming — Randomization and abstract frameworks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1046, Issue , 1996, Pages 667-687

  Gärtner, Bernd ^a   Welzl, Emo ^a  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ABSTRACT FRAMEWORK; ARITHMETIC OPERATIONS; LINEAR PROGRAMS; NON-LINEAR OPTIMIZATION PROBLEMS; OPTIMIZATION PROBLEMS; POLYTOPES; SUB-EXPONENTIAL ALGORITHMS; UNIT COST;

NONLINEAR PROGRAMMING;

EID: 84948146295     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60922-9_54     Document Type: Conference Paper

References (28)

1. Adler, I. and Shamir, R.: A randomized scheme for speeding up algorithms for linear and convex programming problems with high constraints-to-variables ratio. Math. Programming 61 (1993) 39-52
2. Amenta, N.: Helly-type theorems and generalized linear programming. Discrete Comput. Geom. 12 (1994) 241-261
3. Amenta, N.: Bounded boxes, Hausdorff distance, and a new proof of an interesting Helly-type theorem. Proc. 10th Annu. ACM Symp. Computational Geometry (1994) 340-347
4. Borgwaxdt, K. H.: The Simplex Method. A Probabilistic Analysis. Volume 1 of Algorithms and Combinatorics, Springer-Verlag, Berlin-Heidelberg (1987)
5. Chazelle, B., Matoušek, J.: On lineax-time deterministic algorithms for optimization problems in fixed dimensions. Proc. 4th SIAM-ACM Symp. on Discrete Alg. (1993) 281-290
6. Chvátal, V.: Linear Programming. W. H. Freeman, New York, NY (1983).
7. 2) time. Inform. Process. Lett. 22 (1986) 21-24
8. Clarkson, K. L.: A Las Vegas algorithm for linear and integer programming when the dimension is small. J. ACM 42(2) (1995) 488-499
9. Dantzig, G. B.: Linear Programming and Extensions. Princeton University Press, Princeton, NJ (1963).
10. Danzer, Uber ein Problem aus der kombinatorischen Geometrie. Arch. Math. 8 (1957) 347-351
11. Dyer, M. E.: Linear algorithms for two and three-variable linear programs. SIAM J. Comput. 13 (1984) 31-45.
12. Dyer, M. E.: On a multidimensional search technique and its application to the Euclidean one-center problem. SIAM J. Comput. 15 (1986) 725-738
13. Dyer, M. E., Frieze, A. M., A randomized algorithm for fixed-dimensional linear programming. Math. Programming 44 (1989) 203-212
14. Gärtner, B.: A subexponential algorithm for abstract optimization problems. SIAM J. Comput. 24 (1995) 1018-1035
15. Gärtner, B.: Randomized Optimization by Simplex-Type Methods. PhD thesis, Institute for Computer Science, Free University Berlin (1995)
16. Goldwasser, M.: A survey of linear programming in randomized subexponential time. ACM-SIGACT News 26(2) (1995) 96-104
17. Kalai, G.: A subexponential randomized simplex algorithm. Proc. 24th Annu. ACM Symp. Theory of Computing (1992) 475-482
18. Khachiyan, L. G.: Polynomial algorithms in linear programming. U S.S.R. Comput. Math, and Math. Phys. 20 (1980) 53-72
19. Klee, V., Minty, G. J.: How good is the simplex algorithm? In O. Shisha, editor, Inequalities III, Academic Press (1972) 159-175
20. Matoušek, J., Sharir, M., Welzl, E.: A subexponential bound for linear programming. Proc. 8th Annu. ACM Symp. Computational Geometry (1992) 1-8; Algorithmica, to appear
21. Matoušek, J.: Lower bounds for a subexponential optimization algorithm. Random Structures & Algorithms 5(4) (1994) 591-607
22. Matoušek, J.: On geometric optimization with few violated constraints. Proc. 10th Annu. ACM Symp. Computational Geometry (1994) 312-321
23. Megiddo, N.: Linear programming in linear time when the dimension is fixed. J. ACM 31 (1984) 114-127
24. Seidel, R.: Small-dimensional linear programming and convex hulls made easy. Discrete Comput. Geom. 6 (1991) 423-434
25. Shrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1986)
26. Sharir, M., Welzl, E.: A combinatorial bound for linear programming and related problems. Proc. 9th Symp. Theo. Asp. Comp. Sci., Lecture Notes in Computer Science 577 (1992) 569-579
27. Sharir, M., Welzl, E.: Rectilinear and polygonal p-piercing and p-center problems. Manuscript, submitted (1995)
28. Sharir, M., Welzl, E.: Circular and spherical separability. Manuscript, submitted (1995)