Solving integer minimum cost flows with separable convex cost objective polynomially
- 1 January 1986
- book chapter
- Published by Springer Nature
- p. 237-239
- https://doi.org/10.1007/bfb0121104
Abstract
No abstract availableKeywords
This publication has 1 reference indexed in Scilit:
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972