An O(K·n4) algorithm for finding the k best cuts in a network
- 30 November 1982
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 1 (5) , 186-189
- https://doi.org/10.1016/0167-6377(82)90037-2
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- Two Algorithms for Generating Weighted Spanning Trees in OrderSIAM Journal on Computing, 1977
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path ProblemManagement Science, 1972