Two-lattice polyhedra: Duality and extreme points

DOI10.1016/S0012-365X(00)00220-XzbMath0979.52005OpenAlexW1970435155WikidataQ126758601 ScholiaQ126758601MaRDI QIDQ5939917

No author found.

Publication date: 24 February 2002

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00220-x

zbMATH Keywords

submodularitylattice polyhedrapolymatroids

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (2)

Minimizing submodular functions on diamonds via generalized fractional matroid matchings ⋮ An algorithm for weighted fractional matroid matching

This page was built for publication: Two-lattice polyhedra: Duality and extreme points