Sciweavers

ORL
2008
86views more  ORL 2008»
13 years 11 months ago
A redundant Klee-Minty construction with all the redundant constraints touching the feasible region
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"...
Eissa Nematollahi, Tamás Terlaky
TACAS
2009
Springer
144views Algorithms» more  TACAS 2009»
14 years 4 months ago
Computing Optimized Representations for Non-convex Polyhedra by Detection and Removal of Redundant Linear Constraints
Abstract. We present a method which computes optimized representations for non-convex polyhedra. Our method detects so-called redundant linear constraints in these representations ...
Christoph Scholl, Stefan Disch, Florian Pigorsch, ...