Abstract
We construct a class of abstract objective functions on the cube, such that the algorithm BottomAntipodal takes exponentially many steps to find the maximum. A similar class of abstract objective functions is constructed for the process BottomTop, also requiring exponentially many steps.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adler, I., Dantzig, G.B.: Maximum diameter of abstract polytopes. Math. Programming Studies 1, 20–40 (1974)
Adler, L., Saigal, R.: Long monotone paths in abstract polytopes. Math. Oper. Res. 1, 89–95 (1976)
Amenta, N., Ziegler, G.M.: Shadows and slices of polytopes. In: Proc. 12th Annu. ACM Sympos. Comput. Geom., pp. 10–19 (1996)
Gärtner, B., Henk, M., Ziegler, G.M.: Randomized simplex algorithms on Klee-Minty cubes. Combinatorica 18(3), 349–372 (1998)
Gärtner, B., Schurr, I.: Linear Programming and Geometric Unique Sink Orientations. Manuscript in preparation (2004)
Goldfarb, D.: On the complexity of the simplex algorithm. In: Advances in optimization and numerical analysis, pp. 25–38. Kluwer, Dordrecht (1994)
Kaibel, V.: The La Claustra lecture
Kalai, G.: A simple way to tell a simple polytope from its graph. J. Combin. Theory, Ser. A 49(2), 381–383 (1988)
Kalai, G.: A subexponential randomized simplex algorithm. In: Proc. 24th Annu. ACM Sympos. Theory Comput., pp. 475–482 (1992)
Klee, V., Minty, G.J.: How good is the simplex algorithm? In: Shisha, O. (ed.) Inequalities III, pp. 159–175. Academic Press, London (1972)
Matoušek, J., Sharir, M., Welzl, E.: A subexponential bound for linear programming. Algorithmica 16, 498–516 (1996)
Morris, W.D.: Randomized principal pivot algorithms for P-matrix linear complementarity problems. Mathematical Programming Ser. A 92, 285–296 (2002)
Schurr, I., Szabó, T.: Finding the sink takes some time, Discrete and Computational Geometry (to appear); An extended abstract appeared in the proceedings of the European Symposium on Algorithms, ESA (2002)
Szabó, T., Welzl, E.: Unique sink orientations of cubes. In: Proc. 42nd IEEE Symp. on Foundations of Comput. Sci., pp. 547–555 (2001)
Williamson Hoke, K.: Completely unimodal numberings of a simple polytope. Discrete Appl. Math. 20, 69–81 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schurr, I., Szabó, T. (2005). Jumping Doesn’t Help in Abstract Cubes. In: Jünger, M., Kaibel, V. (eds) Integer Programming and Combinatorial Optimization. IPCO 2005. Lecture Notes in Computer Science, vol 3509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11496915_17
Download citation
DOI: https://doi.org/10.1007/11496915_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26199-5
Online ISBN: 978-3-540-32102-6
eBook Packages: Computer ScienceComputer Science (R0)