Sciweavers

Share
5 search results - page 1 / 1
» Translating a convex polyhedron over monotone polyhedra
Sort
View
COMGEO
2002
ACM
12 years 1 months ago
Translating a convex polyhedron over monotone polyhedra
Tetsuo Asano, Antonio Hernández-Barrera, Su...
CORR
2007
Springer
97views Education» more  CORR 2007»
12 years 1 months ago
Unfolding Restricted Convex Caps
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...
Joseph O'Rourke
ORL
2006
65views more  ORL 2006»
12 years 1 months ago
Solving asymmetric variational inequalities via convex optimization
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...
Michele Aghassi, Dimitris Bertsimas, Georgia Perak...
ANOR
2005
131views more  ANOR 2005»
12 years 1 months ago
Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization
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...
Egon Balas
HYBRID
2009
Springer
12 years 8 months ago
Computation of Discrete Abstractions of Arbitrary Memory Span for Nonlinear Sampled Systems
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...
Gunther Reißig
books