LP-related Properties of Polytopes with Few Facets
作者： Falk Tschirschnitz
关键词:
摘要:
sci-hub.st 参考文章(33)
Pavel Valtr, Falk Tschirschnitz, Bernd Gärtner, József Solymosi, Emo Welzl, One line and n points. symposium on the theory of computing. pp. 306- 315 ,(2001)
George J. Minty, Victor Klee, HOW GOOD IS THE SIMPLEX ALGORITHM Inequalities. pp. 159- 175 ,(1970)
Volker Kaibel, Günter M. Ziegler, Micha Sharir, Raphael Mechtel, The Random Edge Rule on Three-Dimensional Linear Programs arXiv: Combinatorics. ,(2003)
Falk Tschirschnitz, Testing extendability for partial chirotopes is np-complete. canadian conference on computational geometry. pp. 165- 168 ,(2001)
Geoffrey R. Grimmett, David Stirzaker, Probability and random processes ,(1982)
Gil Kalai, Linear programming, the simplex algorithm and simple polytopes Mathematical Programming. ,vol. 79, pp. 217- 233 ,(1997) , 10.1007/BF02614318
Jiří Matoušek, Micha Sharir, Emo Welzl, A subexponential bound for linear programming symposium on computational geometry. pp. 1- 8 ,(1992) , 10.1145/142675.142678
Nimrod Megiddo, Linear Programming in Linear Time When the Dimension Is Fixed Journal of the ACM. ,vol. 31, pp. 114- 127 ,(1984) , 10.1145/2422.322418
Walter D. Morris jr., Randomized pivot algorithms for P-matrix linear complementarity problems Mathematical Programming. ,vol. 92, pp. 285- 296 ,(2002) , 10.1007/S101070100268
Jon Lee, Classroom Note:Hoffman's Circle Untangled SIAM Review. ,vol. 39, pp. 98- 105 ,(1997) , 10.1137/S0036144595292991