Polyhedra related to a lattice

DOI10.1007/BF01584230zbMath0461.90053OpenAlexW2095207331MaRDI QIDQ3911666

Viatcheslav Grishukhin

Publication date: 1981

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01584230

zbMATH Keywords

integral polyhedrapolymatroidssubmodular functionsparallel setinteger polyhedraHoffman's lattice polyhedramatching polyhedrontotally unimodular constraint matrix

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Inequalities and extremum problems involving convexity in convex geometry (52A40) Boolean programming (90C09) Polytopes and polyhedra (52Bxx)

Related Items (2)

Proving total dual integrality with cross-free families—A general framework ⋮ Fractional matroid matchings

Cites Work

• On two minimax theorems in graph
• A Minimax Theorem for Directed Graphs
• Packing rooted directed cuts in a weighted directed graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Polyhedra related to a lattice