摘要: A solution method is given for a class of practical optimization problems requiring the determination consistent partial ordering sets objects, events, preferences, and like. These are characterized by existence “noisy” or contradictory links varying strengths. The origin this an anthropological study in which it desired to specify global chronological ancient cemetery data. mathematical formulation results minimum weight feedback model. heuristic developed similar Greedy algorithm spanning trees requires only one pass through network.
sci-hub.se 参考文章(7)
Joseph B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem Proceedings of the American Mathematical Society. ,vol. 7, pp. 48- 50 ,(1956) , 10.1090/S0002-9939-1956-0078686-7
Jack Edmonds, Matroids and the greedy algorithm Mathematical Programming. ,vol. 1, pp. 127- 136 ,(1971) , 10.1007/BF01584082
M. L. Balinski, Integer Programming: Methods, Uses, Computations Management Science. ,vol. 12, pp. 253- 313 ,(1965) , 10.1287/MNSC.12.3.253
Claude Berge, The theory of graphs and its applications ,(1962)
A. Kershenbaum, R. Van Slyke, Computing minimum spanning trees efficiently Proceedings of the ACM annual conference on - ACM'72. pp. 518- 527 ,(1972) , 10.1145/800193.569966
W. W. Cooper, A. Charnes, Management Models and Industrial Applications of Linear Programming ,(1961)
Patrick Rivett, Principles of Operations Research ,(1972)