Jonathan Ashley, Brian Marcus, et al.
Ergodic Theory and Dynamical Systems
Paper
Separating from the dominant of the spanning tree polytope
Abstract
We study the separation problem for the partition inequalities that define the dominant of the spanning tree polytope of a graph G = (V, E). We show that a most violated inequality can be found by solving at most |V| maximum flow problems. Cunningham (1985) had solved this as a sequence of |E| maximum flow problems. © 1992.
Related
Conference paper
Wavefront and caustic surfaces of refractive laser beam shaper
David L. Shealy, John A. Hoffnagle
SPIE Optical Engineering + Applications 2007
Hang-Yip Liu, Steffen Schulze, et al.
Proceedings of SPIE - The International Society for Optical Engineering
Vladimir Yanovski, Israel A. Wagner, et al.
Ann. Math. Artif. Intell.