An efficient algorithm for the minimum capacity cut problem
- 1 May 1990
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 47 (1) , 19-36
- https://doi.org/10.1007/bf01580850
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Optimization of a 532-city symmetric traveling salesman problem by branch and cutOperations Research Letters, 1987
- A new approach to the maximum flow problemPublished by Association for Computing Machinery (ACM) ,1986
- Data Structures and Network AlgorithmsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1983
- Solving Large-Scale Symmetric Travelling Salesman Problems to OptimalityManagement Science, 1980
- Generalized Feedback Shift Register Pseudorandom Number AlgorithmJournal of the ACM, 1973
- Multi-Terminal Network FlowsJournal of the Society for Industrial and Applied Mathematics, 1961
- A note on the maximum flow through a networkIEEE Transactions on Information Theory, 1956
- Maximal Flow Through a NetworkCanadian Journal of Mathematics, 1956