Polyhedra of regular p-nary group problems

Polyhedra of regular p-nary group problems

0.00 Avg rating0 Votes
Article ID: iaor1988647
Country: Netherlands
Volume: 43
Issue: 1
Start Page Number: 1
End Page Number: 29
Publication Date: Jan 1989
Journal: Mathematical Programming (Series A)
Authors: , ,
Abstract:

The duality for group problems developed earlier is restricted to p-nary group problems. Results for ternary group problems are obtained similar to those obtained by Fulkerson and Lehman for the binary case. A complete facet description of the group polyhedron is available for a group problem having the Fulkerson property. A group problem has the Fulkerson property if its vertices are the facets of the blocking group problem and it its facets are the vertices of the blocking group problem. The Fulkerson property is a generalization of the max-flow min-cut theorem of Ford and Fulkerson which is interpreted as a statement about the pair of row modules arising from a group problem. The authors show that a group problem has the Fulkerson property if the corresponding row module is regular.

Reviews

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