Sciweavers

3 search results - page 1 / 1
» Separation, dimension, and facet algorithms for node flow po...
Sort
View
MP
2010
99views more  MP 2010»
13 years 2 months ago
Separation, dimension, and facet algorithms for node flow polyhedra
Abstract; Dedicated to Alan J. Hoffman Ball et al. propose a graph model for material compatibility constraints for products such as PCs made from components, where each componen...
Maren Martens, S. Thomas McCormick, Maurice Queyra...
DCG
2008
93views more  DCG 2008»
13 years 4 months ago
Metric Combinatorics of Convex Polyhedra: Cut Loci and Nonoverlapping Unfoldings
Let S be the boundary of a convex polytope of dimension d + 1, or more generally let S be a convex polyhedral pseudomanifold. We prove that S has a polyhedral nonoverlapping unfold...
Ezra Miller, Igor Pak
DISOPT
2008
91views more  DISOPT 2008»
13 years 4 months ago
Partition inequalities for capacitated survivable network design based on directed p-cycles
We study the design of capacitated survivable networks using directed p-cycles. A p-cycle is a cycle with at least three arcs, used for rerouting disrupted flow during edge failur...
Alper Atamtürk, Deepak Rajan