A good algorithm for lexicographically optimal flows in multi-terminal networks
Open Access
- 1 January 1977
- journal article
- Published by American Mathematical Society (AMS) in Bulletin of the American Mathematical Society
- Vol. 83 (3) , 407-409
- https://doi.org/10.1090/s0002-9904-1977-14298-5
Abstract
References [Enhancements On Off] (What's this?)Keywords
This publication has 4 references indexed in Scilit:
- Network Flow and Testing Graph ConnectivitySIAM Journal on Computing, 1975
- Optimal flows in networks with multiple sources and sinksMathematical Programming, 1974
- Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJournal of the ACM, 1972
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965