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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
