Separating from the dominant of the spanning tree polytope

Separating from the dominant of the spanning tree polytope

0.00 Avg rating—0 Votes
Article ID: iaor19931142
Country: Netherlands
Volume: 12
Issue: 4
Start Page Number: 201
End Page Number: 203
Publication Date: Oct 1992
Journal: Operations Research Letters
Authors:
Abstract:

The paper studies the separation problem for the partition inequalities that define the dominant of the spanning tree polytope of a graph G=(V,E). It shows that a most violated inequality can be found by solving at most ℝVℝ maximum flow problems. Cunningham had solved this as a sequence of ℝEℝ maximum flow problems.

Reviews

Required fields are marked *. Your email address will not be published.