On finding the K best cuts in a network
- 1 March 1984
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 2 (6) , 303-305
- https://doi.org/10.1016/0167-6377(84)90083-x
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- An O(K·n4) algorithm for finding the k best cuts in a networkOperations Research Letters, 1982
- A data structure for dynamic treesPublished by Association for Computing Machinery (ACM) ,1981
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing CostOperations Research, 1968
- Some Network Flow Problems Solved with Pseudo-Boolean ProgrammingOperations Research, 1965