About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Publication
Operations Research Letters
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.