Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

61

Voted

COMPGEOM
1990
ACM

favoriteEmaildiscussreport

59views Discrete Geometry» more COMPGEOM 1990»

Linear Programming and Convex Hulls Made Easy

15 years 1 months ago

Linear Programming and Convex Hulls Made Easy

Download www.eecs.berkeley.edu

Raimund Seidel

Real-time Traffic

COMPGEOM 1990 | Discrete Geometry |

claim paper

Related Content

» A Pivoting Algorithm for Convex Hulls and Vertex Enumeration of Arrangements and Polyhedra

» Finite Disjunctive Programming Characterizations for General MixedInteger Linear Programs

» Multipass geometric algorithms

» Compact formulations as a union of polyhedra

» Learning to rank using 1norm regularization and convex hull reduction

» Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets

» Resolving Loads with Positive Interior Stresses

» The Linear Programming Polytope of Binary Constraint Problems with Bounded TreeWidth

» Stability in Discrete Tomography Linear Programming Additivity and Convexity

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1990
Where	COMPGEOM
Authors	Raimund Seidel

Comments (0)