Extreme points and adjacency relationship in the flow polytope

DOI10.1007/BF02575918zbMath0406.90022MaRDI QIDQ1257824

Claudio Sodini, Giorgio Gallo

Publication date: 1978

Published in: Calcolo (Search for Journal in Brave)

zbMATH Keywords

Extreme PointsAdjacencyCapacitated DigraphFlow PolytopeFlows in NetworksMaximal Flow Problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (6)

On flow polytopes, order polytopes, and certain faces of the alternating sign matrix polytope ⋮ Simple extensions of polytopes ⋮ Column-convex matrices, \(G\)-cyclic orders, and flow polytopes ⋮ Flow-oriented perturbation theory ⋮ Concave cost minimization on networks ⋮ Volumes and Ehrhart polynomials of flow polytopes

Cites Work

• Unnamed Item
• Minimum Concave Cost Flows in Certain Networks
• A generalized upper bounding algorithm for multicommodity network flow problems

This page was built for publication: Extreme points and adjacency relationship in the flow polytope