Coflow polyhedra

DOI10.1016/0012-365X(92)90585-4zbMath0773.90025OpenAlexW2913637164MaRDI QIDQ1197009

Jack Edmonds, Kathie Cameron

Publication date: 16 January 1993

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

Full work available at URL: https://doi.org/10.1016/0012-365x(92)90585-4

zbMATH Keywords

digraphlinear inequalitiesnetwork flowtotally dual integralprojection of a polyhedroncoflow polyhedron theorem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Partial orders, general (06A06) Combinatorics of partially ordered sets (06A07) Deterministic network models in operations research (90B10) Polyhedra and polytopes; regular figures, division of spaces (51M20) Directed graphs (digraphs), tournaments (05C20) Polytopes and polyhedra (52Bxx)

Related Items (11)

On k-optimum dipath partitions and partial k-colourings of acyclic digraphs ⋮ Switchdec polyhedra ⋮ Minmax relations for cyclically ordered digraphs ⋮ On box-perfect graphs ⋮ Berge's conjecture on directed path partitions -- a survey ⋮ Graph covers using \(t\)-colourable vertex sets. ⋮ The travelling preacher, projection, and a lower bound for the stability number of a graph ⋮ A min-max relation for the partial q-colourings of a graph. II: Box perfection ⋮ Polyhedra with the integer Carathéodory property ⋮ Path Partitions, Cycle Covers and Integer Decomposition ⋮ Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On switching paths polyhedra
• A min-max relation for the partial q-colourings of a graph. II: Box perfection
• On k-optimum dipath partitions and partial k-colourings of acyclic digraphs
• On chain and antichain families of a partially ordered set
• Some partitions associated with a partially ordered set
• Anti-blocking polyhedra
• Normal hypergraphs and the perfect graph conjecture
• A decomposition theorem for partially ordered sets
• The perfectly matchable subgraph polytope of a bipartite graph
• On a routing problem
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• The structure of Sperner k-families

This page was built for publication: Coflow polyhedra