43 search results - page 1 / 9 » Linear Programming and Convex Hulls Made Easy |
COMPGEOM
1990
ACM
13 years 9 months ago
1990
ACM
COMPGEOM
1991
ACM
13 years 9 months ago
1991
ACM
We present a new pivot-based algorithm which can be used with minor modification for the enumeration of the facets of the convex hull of a set of points, or for the enumeration o...
IOR
2011
13 years 21 days ago
2011
In this paper, we give a finite disjunctive programming procedure to obtain the convex hull of general mixed-integer linear programs (MILP) with bounded integer variables. We prop...
COMPGEOM
2005
ACM
13 years 7 months ago
2005
ACM
We initiate the study of exact geometric algorithms that require limited storage and make only a small number of passes over the input. Fundamental problems such as lowdimensional...
MP
2008
13 years 5 months ago
2008
We explore one method for finding the convex hull of certain mixed integer sets. The approach is to break up the original set into a small number of subsets, find a compact polyhed...