Lattice Polyhedra II: Generalization, Constructions and Examples

DOI10.1016/S0304-0208(08)73265-1zbMath0507.90062OpenAlexW2198935113MaRDI QIDQ4745614

Alan J. Hoffman, Heinz Groeflin

Publication date: 1982

Published in: North-Holland Mathematics Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-0208(08)73265-1

zbMATH Keywords

modularlattice polyhedrasubmodular functionssupermodularnode cuts for directed graphs

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorial aspects of matroids and geometric lattices (05B35) Polytopes and polyhedra (52Bxx)

Related Items (12)

On box totally dual integral polyhedra ⋮ Optimum partitioning into intersections of ring families ⋮ Switchdec polyhedra ⋮ Open shop problem with zero-one time operations and integer release date/deadline intervals ⋮ Restrictions and preassignments in preemptive open shop scheduling ⋮ Lattice polyhedra and submodular flows ⋮ A Primal-Dual Algorithm for Weighted Abstract Cut Packing ⋮ Abstract flows over time: a first step towards solving dynamic packing problems ⋮ Lattice matrices, intersection of ring families and dicuts ⋮ On switching paths polyhedra ⋮ On the submodular matrix representation of a digraph. ⋮ Path-closed sets

This page was built for publication: Lattice Polyhedra II: Generalization, Constructions and Examples