Back to search
Extreme points and adjacency relationship in the flow polytope
Data up to Jan 2025
Published1978
Citations14
References7
Total Citations Per Year
Abstract
References (7)
Linear Programming and Extensions
1963 • 5,853 citations
Linear Programming and Extensions
1963 • 2,647 citations
Minimum Concave Cost Flows in Certain Networks
1968 • 308 citations
Networks and Basic Solutions
1966 • 120 citations
A generalized upper bounding algorithm for multicommodity network flow problems
1971 • 60 citations
A Property of Minimum Concave Cost Flows in Capacitated Networks*
1971 • 11 citations
Algèbre moderne et théorie des graphes
2017 • 8 citations
Cited By (0)
Loading...