R.B. Morris, Y. Tsuji, et al.
International Journal for Numerical Methods in Engineering
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
Zhihua Xiong, Yixin Xu, et al.
International Journal of Modelling, Identification and Control
Jonathan Ashley, Brian Marcus, et al.
Ergodic Theory and Dynamical Systems
Ziv Bar-Yossef, T.S. Jayram, et al.
Journal of Computer and System Sciences