K best solutions to combinatorial optimization problems
- 1 December 1985
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 4 (1) , 123-143
- https://doi.org/10.1007/bf02022039
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- On finding the K best cuts in a networkOperations Research Letters, 1984
- An Algorithm for Finding K Minimum Spanning TreesSIAM Journal on Computing, 1981
- The k best spanning arborescences of a networkNetworks, 1980
- Ranking arborescences in O(Km log n) timeEuropean Journal of Operational Research, 1980
- Combinatorial Optimization: What is the State of the ArtMathematics of Operations Research, 1980
- 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
- Matroids and the greedy algorithmMathematical Programming, 1971
- Some Network Flow Problems Solved with Pseudo-Boolean ProgrammingOperations Research, 1965
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965