K best solutions to combinatorial optimization problems
暂无分享,去创建一个
[1] P. L. Ivanescu. Some Network Flow Problems Solved with Pseudo-Boolean Programming , 1965 .
[2] Katta G. Murty,et al. Letter to the Editor - An Algorithm for Ranking all the Assignments in Order of Increasing Cost , 1968, Oper. Res..
[3] Katta G. Murty,et al. Solving the Fixed Charge Problem by Ranking the Extreme Points , 1968, Oper. Res..
[4] C. Berge. Graphes et hypergraphes , 1970 .
[5] Jack Edmonds,et al. Matroids and the greedy algorithm , 1971, Math. Program..
[6] W. T. Tutte. Introduction to the theory of matroids , 1971 .
[7] E. Lawler. A PROCEDURE FOR COMPUTING THE K BEST SOLUTIONS TO DISCRETE OPTIMIZATION PROBLEMS AND ITS APPLICATION TO THE SHORTEST PATH PROBLEM , 1972 .
[8] Harold N. Gabow,et al. Two Algorithms for Generating Weighted Spanning Trees in Order , 1977, SIAM J. Comput..
[9] Francesco Maffioli,et al. The k best spanning arborescences of a network , 1980, Networks.
[10] Victor Klee,et al. Combinatorial Optimization: What is the State of the Art , 1980, Math. Oper. Res..
[11] P. Camerini,et al. Ranking arborescences in O(Km log n) time , 1980 .
[12] G. M. Weber. Sensitivity analysis of optimal matchings , 1981, Networks.
[13] Toshihide Ibaraki,et al. An Algorithm for Finding K Minimum Spanning Trees , 1981, SIAM J. Comput..
[14] U. Zimmermann. Linear and combinatorial optimization in ordered algebraic structures , 1981 .
[15] Nimrod Megiddo,et al. An O(n log2 n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems , 1981, SIAM J. Comput..
[16] Rainer E. Burkard,et al. Combinatorial optimization in linearly ordered semimodules: A survey , 1982 .
[17] J. Picard,et al. Selected Applications of Minimum Cuts in Networks , 1982 .
[18] Robert E. Tarjan,et al. A data structure for dynamic trees , 1981, STOC '81.
[19] J. Picard,et al. Ranking the Cuts and Cut-Sets of a Network , 1984 .
[20] Horst W. Hamacher,et al. On finding the K best cuts in a network , 1984 .
[21] Ulrich Dergis,et al. Some basic exchange properties in combinatorial optimization and their application to constructing the K-best solutions , 1985 .