An Application of Generalized Linear Programming to Network Flows
- 1 June 1962
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in Journal of the Society for Industrial and Applied Mathematics
- Vol. 10 (2), 260-283
- https://doi.org/10.1137/0110020
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Multi-Terminal Network FlowsJournal of the Society for Industrial and Applied Mathematics, 1961
- Decomposition Principle for Linear ProgramsOperations Research, 1960
- A Suggested Computation for Maximal Multi-Commodity Network FlowsManagement Science, 1958
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957
- A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock ProblemCanadian Journal of Mathematics, 1957
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956
- Maximal Flow Through a NetworkCanadian Journal of Mathematics, 1956