Characterizing and recognizing generalized polymatroids

DOI10.1007/S10107-013-0685-5MaRDI QIDQ403645zbMATH OpenOpenAlexFDO

Authors András Frank, Tamás Király, Júlia Pap, David Pritchard

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

Linear programming (90C05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Nonnumerical algorithms (68W05) 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)

Recommendations

• scientific article; zbMATH DE number 3906513
• On cardinality constrained polymatroids
• A note on Frank's generalized polymatroids
• Recognizing Polymatroids Associated with Hypergraphs
• Generalized polymatroids and submodular flows

Cites work

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

Cited in

(9)

• A note on Frank's generalized polymatroids
• Base polyhedra and the linking property
• Recognizing Polymatroids Associated with Hypergraphs
• scientific article; zbMATH DE number 3906513 (Why is no real title available?)
• Least Majorized Elements and Generalized Polymatroids
• scientific article; zbMATH DE number 4023308 (Why is no real title available?)
• A characterization of network representable polymatroids
• A NOTE ON THE DECOMPOSITION OF POLY-LINKING SYSTEMS AND THE MINORS OF GENERALIZED POLYMATROIDS
• A Geometric Characterization of Poly-antimatroids

This page was built for publication: Characterizing and recognizing generalized polymatroids

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403645)