Keyword

Hirsch conjecture

Description: The Hirsch conjecture is a statement in polyhedral combinatorics bounding shortest paths between vertices of a convex polytope.
Wikidata ID: wiki/Q2993326
OpenAlex ID: keywords/hirsch-conjecture
1995 · Günter M. Ziegler · Graduate texts in mathematics · 3,439
1980 · J. Scott Provan, Louis J. Billera · Mathematics of Operations Research · 282
2012 · Francisco Santos · Annals of Mathematics · 277
1992 · Gil Kalai, Daniel J. Kleitman · Bulletin of the American Mathematical Society · 191
1967 · Victor Klee, David W. Walkup · Acta Mathematica · 186
1989 · Denis Naddef · Mathematical Programming · 136
1987 · Victor Klee, Peter Kleinschmidt · Mathematics of Operations Research · 126
1974 · M. L. Balinski, Andrew Russakoff · SIAM Review · 113
2018 · Xavier Allamigeon, Pascal Benchimol, et al. · SIAM Journal on Applied Algebra and Geometry · 94
1974 · Manfred W. Padberg, M. R. Rao · Mathematical Programming · 94
2014 · Nicolas Bonifas, Marco Di Summa, et al. · Discrete & Computational Geometry · 79
1984 · M. L. Balinski · Mathematics of Operations Research · 70
1966 · Victor Klee · Pacific Journal of Mathematics · 69
2010 · Edward D. Kim, Francisco Santos · Jahresbericht der Deutschen Mathematiker-Vereinigung · 63
2014 · Michael J. Todd · SIAM Journal on Discrete Mathematics · 51
2001 · Imre Bárány, Attila Pór · Advances in Mathematics · 48
2015 · Benjamin Matschke, Francisco Santos, et al. · Proceedings of the London Mathematical Society · 46
1974 · David Barnette · Discrete Mathematics · 46
2010 · Friedrich Eisenbrand, Nicolai Hähnle, et al. · Mathematics of Operations Research · 42
1980 · Michael J. Todd · Mathematics of Operations Research · 40
1992 · Gil Kalai · Discrete & Computational Geometry · 39
1998 · F. B. Holt, V. Klee · Discrete & Computational Geometry · 37
2017 · S. Borgwardt, J. A. De Loera, et al. · Mathematical Programming · 34
Works count: 179
Citation count: 6,743
Year
Topic
Type