Generalized polymatroids and submodular flows
- 1 April 1988
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 42 (1-3) , 489-563
- https://doi.org/10.1007/bf01589418
Abstract
No abstract availableKeywords
This publication has 62 references indexed in Scilit:
- On box totally dual integral polyhedraMathematical Programming, 1986
- The Partial Order of a Polymatroid Extreme PointMathematics of Operations Research, 1985
- Optimal attack and reinforcement of a networkJournal of the ACM, 1985
- Total Dual Integrality from Directed Graphs, Crossing Families, and Sub- and Supermodular FunctionsPublished by Elsevier ,1984
- The perfectly matchable subgraph polytope of a bipartite graphNetworks, 1983
- Arc‐disjoint arborescences of digraphsJournal of Graph Theory, 1983
- Submodular functions and convexityPublished by Springer Nature ,1983
- An unbounded matroid intersection polyhedronLinear Algebra and its Applications, 1977
- A Minimax Equality Related to the Longest Directed Path in an Acyclic GraphCanadian Journal of Mathematics, 1975
- Note on Independence FunctionsProceedings of the London Mathematical Society, 1957