Characterization of all optimal solutions and parametric maximal mows in networks
- 1 January 1985
- journal article
- Published by Taylor & Francis in Optimization
- Vol. 16 (1) , 51-61
- https://doi.org/10.1080/02331938508842988
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- On the structure of all minimum cuts in a network and applicationsPublished by Springer Nature ,1980
- Adjacent extreme flows and application to min concave cost flow problemsNetworks, 1979
- Numerical investigations on the maximal flow algorithm of KarzanovComputing, 1979
- A new algorithm for the maximal flow problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- Dynamic Programming Solution of Sequencing Problems with Precedence ConstraintsOperations Research, 1978
- Networks and Basic SolutionsOperations Research, 1966