[1] X.Ning and Y.shi.The maximum flow problem of a network in the emergency situation[C].In proceedings of the Second International Conference on Systems Science and Systems Engineering,pp.555-558,International academic Publishers,Beijing,(1993); ICSSSE' 93,August 24-27,1993,Beijing,China.
[2] 宁宣熙,等,流通网络中随机流动的仿真研究[J].数据采集与处理,2002,17(3):337-340.
[3] 丁宣熙.有向网络的最小流问题及其分枝定界解法[J].系统工程,1996,14(5):61-66.
[4] 宁宣熙.求解网络最小流的双向增流算法[J].系统工程,1997,15(1):50-57.
[5] Ning Xuanxi,Research on the blocking flow in a transportation network[J].Transaction of Nanjing University of Aeronautics & Astronautcs,1994,11 (2):215-223.
[6] Ning Xuanxi,Research on the blocking flow in a transportaion network(Ⅱ)-blocking cutest of a network and its determination[J].Transaction of Nanjing University of Aeronautics & Astronautics,1996,13(1):97-101.
[7] Ning Xuanxi,The application of the branch-and-bound methods for determining the minimum flow of a transport network-Research on the blocking flow in a transport network(Ⅲ)[J].Transaction of Nanjing University of Aeronautics & Astronautcs,1996,13(2):164-168.
[8] 宁宣熙.堵塞流理论及其应用[M].科学出版社,北京,2004.3.
[9] Ning Xuanxi.The miniumum spanning flow in a networkand its self-organization principle.Kybernetes:the International Journal of Systems and Cybernetics,2004,33(2):331-338.
[10] 吴薇薇,宁宣熙.运输网络中最小饱和流的求解[J].数学的实践与认识,已录用.
[11] Iri Mason,Theory of uncontrollable flows-a new type of network-flow theory as a model for the 21st century of multiple values[J].Computers Math Applic,1998.
[12] M.Shigeno,I.Takahashi and Y.Yamamoto,Minimum Maximal Flow Problem:An Optimization over the Efficient Set[J].Journal of Global Optimization,2003,25:425-443.
[13] Yixun Lin,Xianglu Li,Junqiang Deng,The minimum saturated flow problem in emergency networks[J].Operation Research Transactions,2001,5 (2):12-20.
[14] 吴薇薇,宁宣熙.紧急疏散网络防堵塞改造研究[J].系统工程学报,2006,(4). |
