ORL
2008
14 years 15 days ago
2008
By introducing some redundant Klee-Minty constructions, we have previously shown that the central path may visit every vertex of the Klee-Minty cube having 2n - 2 "sharp"...
TACAS
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. We present a method which computes optimized representations for non-convex polyhedra. Our method detects so-called redundant linear constraints in these representations ...