5 search results - page 1 / 1 » Translating a convex polyhedron over monotone polyhedra |
COMGEO
2002
ACM
13 years 4 months ago
2002
ACM
CORR
2007
Springer
13 years 4 months ago
2007
Springer
This paper details an algorithm for unfolding a class of convex polyhedra, where each polyhedron in the class consists of a convex cap over a rectangular base, with several restri...
ORL
2006
13 years 4 months ago
2006
Using duality, we reformulate the asymmetric variational inequality (VI) problem over a conic region as an optimization problem. We give sufficient conditions for the convexity of...
ANOR
2005
13 years 4 months ago
2005
Abstract. This is an overview of the significance and main uses of projection, lifting and extended formulation in integer and combinatorial optimization. Its first two sections de...
HYBRID
2009
Springer
13 years 11 months ago
2009
Springer
ion of discrete abstractions of arbitrary memory span for nonlinear sampled systems Gunther Reißig⋆ Technische Universit¨at Berlin, Fakult¨at Elektrotechnik und Informatik, He...