Minimum cuts and related problems
- 11 October 1975
- Vol. 5 (4), 357-370
- https://doi.org/10.1002/net.3230050405
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Minimal Cost Cut Equivalent NetworksManagement Science, 1973
- A Graph-Theoretic Equivalence for Integer ProgramsOperations Research, 1973
- Notes—On a Selection ProblemManagement Science, 1970
- A Selection Problem of Shared Fixed Costs and Network FlowsManagement Science, 1970
- Boolean Methods in Operations Research and Related AreasPublished by Springer Nature ,1968
- Some Network Flow Problems Solved with Pseudo-Boolean ProgrammingOperations Research, 1965
- Multi-Terminal Network FlowsJournal of the Society for Industrial and Applied Mathematics, 1961
- Maximal Flow Through a NetworkCanadian Journal of Mathematics, 1956