Author:
Peng Jin,Zhang Bo,Li Shengguo
Publisher
Springer Science and Business Media LLC
Reference68 articles.
1. Lawler, E: Combinatorial Optimization: Networks and Matroids. Holt, Reinhardt and Winston, New York (2001).
2. Lee, J: A first course in combinatorial optimization. Cambridge University Press, Cambridge (2004).
3. Dreyfus, S: An appraisal of some shortest path algorithms. Oper. Res. 17(3), 395–412 (1969).
4. Graham, RL, Hell, P: On the history of the minimum spanning tree problem. IEEE Ann. Hist. Comput. 7(1), 43–57 (1985).
5. Haley, KB: New methods in mathematical programming–the solid transportation problem. Oper. Res. 10(4), 448–463 (1962).
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Introduction;Uncertain Graph and Network Optimization;2022
2. Mathematical Models for Logistics Network Optimization with Uncertain Data;Proceedings of the 2019 International Conference on Information Technology and Computer Communications - ITCC 2019;2019
3. Uncertain Distribution-Minimum Spanning Tree Problem;International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems;2016-08
4. An α-cut chromatic number of a total uncertain graph and its properties;AIP Conference Proceedings;2016
5. Determination of Target Values of Engineering Characteristics in QFD Using Uncertain Programming;Journal of Uncertainty Analysis and Applications;2015-12