On switching paths polyhedra

DOI10.1007/BF02579449zbMath0625.52006OpenAlexW1995468686MaRDI QIDQ579630

Heinz Groeflin

Publication date: 1987

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

min-max theoremstotally dual integralswitching paths polyhedra

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Paths and cycles (05C38) Existence of solutions for minimax problems (49J35) Directed graphs (digraphs), tournaments (05C20) Polytopes and polyhedra (52Bxx)

Related Items (4)

Switchdec polyhedra ⋮ Coflow polyhedra ⋮ Lattice matrices, intersection of ring families and dicuts ⋮ A min-max relation for the partial q-colourings of a graph. II: Box perfection

Cites Work

• Unnamed Item
• Unnamed Item
• Path-closed sets
• On matroid intersections
• Strong versions of Sperner's theorem
• On partitions of a partially ordered set
• A decomposition theorem for partially ordered sets
• A generalization of max flow—min cut
• Lattice Polyhedra II: Generalization, Constructions and Examples

This page was built for publication: On switching paths polyhedra