-
1
-
2
An Approach to Three-Dimensional Decomposition and Description of Polyhedra
Published 2008Get full text
Working Paper -
3
-
4
Capacitated Trees, Capacitated Routing, and Associated Polyhedra
Published 2004“…For each of these problems, and for a forest relaxation of the minimal spanning tree problem, we introduce a number of new valid inequalities and specify conditions for ensuring when these inequalities are facets for the associated integer polyhedra. The inequalities are defined by one of several underlying support graphs: (i) a multistar, a "star" with a clique replacing the central vertex; (ii) a clique cluster, a collection of cliques intersecting at a single vertex, or more generally at a central" clique; and (iii) a ladybug, consisting of a multistar as a head and a clique as a body. …”
Get full text
Working Paper -
5
An Application of Line-labeling and other Scene-analysis Techniques to the Problem of Hidden-line Removal
Published 2008Get full text
Working Paper -
6
A Polyhedral Intersection Theorem for Capacitated Spanning Trees
Published 2004“…This result is one of very few known cases in which the intersection of two integer polyhedra yields another integer polyhedron. We also give a complete polyhedral characterization of a related polytope, the 2-capacitated forest polytope.…”
Get full text
Working Paper -
7
-
8
Generating Semantic Description from Drawings of Scenes with Shadows
Published 2008Get full text
Working Paper -
9
Transitive Packing: A Unifying Concept in Combinatorial Optimization
Published 2004“…This paper attempts to give a better understanding of the facial structure of previously separately investigated polyhedra. It introduces the notion of transitive packing and the transitive packing polytope. …”
Get full text
Working Paper