Polyhedra of regular p-nary group problems

DOI10.1007/BF01582275zbMath0673.90068MaRDI QIDQ1121172

Sunil Chopra, Ellis L. Johnson, David L. Jensen

Publication date: 1989

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

max-flow min-cut theoremFulkerson propertyp-nary group problemrow module

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Deterministic network models in operations research (90B10) Polytopes and polyhedra (52Bxx)

Related Items (2)

On ternary problems ⋮ Dual row modules and polyhedra of blocking group problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Matroid representation over GF(3)
• Matroids and multicommodity flows
• The matroids with the max-flow min-cut property
• A note on the production of matroid minors
• On Reid's characterization of the ternary matroids
• Some polyhedra related to combinatorial problems
• On the Generality of the Subadditive Characterization of Facets
• Binary group and Chinese postman polyhedra
• Dual row modules and polyhedra of blocking group problems
• On the width—length inequality
• The Forbidden Minors of Binary Clutters
• On the Abstract Properties of Linear Dependence
• ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
• A Solution of the Shannon Switching Game
• Lectures on matroids
• Matroids and the greedy algorithm

This page was built for publication: Polyhedra of regular p-nary group problems