Algorithms for flows with parametric capacities
- 1 January 1989
- journal article
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 33 (1) , 21-37
- https://doi.org/10.1007/bf01415514
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Characterization of all optimal solutions and parametric maximal mows in networksOptimization, 1985
- Complexity of some parametric integer and network programming problemsMathematical Programming, 1983
- Computational complexity of parametric linear programmingMathematical Programming, 1980
- Algebraic flows in regular matroidsDiscrete Applied Mathematics, 1980
- Critical Load Factors in Two-Processor Distributed SystemsIEEE Transactions on Software Engineering, 1978
- Multiprocessor Scheduling with the Aid of Network Flow AlgorithmsIEEE Transactions on Software Engineering, 1977
- Mathematical Techniques for Efficient Record Segmentation in Large Shared DatabasesJournal of the ACM, 1976
- A bad network problem for the simplex method and other minimum cost flow algorithmsMathematical Programming, 1973
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- On a routing problemQuarterly of Applied Mathematics, 1958