On switching paths polyhedra

DOI10.1007/BF02579449MaRDI QIDQ579630zbMATH OpenOpenAlexFDO

Authors 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) Directed graphs (digraphs), tournaments (05C20) Deterministic network models in operations research (90B10) Polytopes and polyhedra (52Bxx) Paths and cycles (05C38) Existence of solutions for minimax problems (49J35)

Recommendations

• Switchdec polyhedra
• Coflow polyhedra
• Algorithms for submodular totally dual integral problems
• On totally dual integral systems
• On box totally dual integral polyhedra

Cites work

• scientific article; zbMATH DE number 3165195 (Why is no real title available?)
• scientific article; zbMATH DE number 3580570 (Why is no real title available?)
• A decomposition theorem for partially ordered sets
• A generalization of max flow—min cut
• Lattice Polyhedra II: Generalization, Constructions and Examples
• On matroid intersections
• On partitions of a partially ordered set
• Path-closed sets
• Strong versions of Sperner's theorem

Cited in

(4)

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

This page was built for publication: On switching paths polyhedra

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