Characterizing and recognizing generalized polymatroids

DOI10.1007/s10107-013-0685-5zbMath1327.52018OpenAlexW2152510786MaRDI QIDQ403645

J. Herrera, H. S. Yoon

Publication date: 29 August 2014

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

Full work available at URL: http://real.mtak.hu/20828/1/egres-12-03.pdf

zbMATH Keywords

generalized polymatroidinteger polyhedratotal dual laminarity

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Nonnumerical algorithms (68W05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Combinatorial optimization (90C27)

Related Items

Base polyhedra and the linking property

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lifted generalized permutahedra and composition polynomials
• Is submodularity testable?
• Recognizing conic TDI systems is hard
• Convexity and Steinitz's exchange property
• A note on Frank's generalized polymatroids
• The complexity of recognizing linear systems with certain integrality properties
• Faces of generalized permutohedra
• Matroid polytopes and their volumes
• Covering skew-supermodular functions by hypergraphs of minimum total size
• Generalized polymatroids and submodular flows
• Discrete convexity and unimodularity. I.
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• On recognizing integer polyhedra
• A Survey on Covering Supermodular Functions
• Proving total dual integrality with cross-free families—A general framework
• Permutohedra, Associahedra, and Beyond
• Augmenting Graphs to Meet Edge-Connectivity Requirements
• Matroids and the greedy algorithm