复杂网络理论在《运筹学》中的探究式应用研究——以图与网络分析为例
Exploratory Application of Complex Network Theory in Operation Research—Taking Graph and Network Analysis as an Example
DOI: 10.12677/pm.2024.144135, PDF,    科研立项经费支持
作者: 王海英*, 顾长贵, 刘媛华:上海理工大学管理学院,上海
关键词: 探究式教学运筹学复杂网络Exploratory Teaching Operation Research Complex Networks
摘要: 随着科研领域的发展,拓宽了对知识的教学引导途径。作为运筹学的重要内容,图与网络分析也迎来了新的科研领域的冲击,迫使教师们在教育教学方面实行探究性教学。首先,通过对图与网络分析教学内容进行分析,并介绍了其在解决现实问题的局限性。然后,介绍了复杂网络理论及其解决优势,并重点分析了引入复杂网络理论到其探究式教学实施过程。以此激发学生的学习兴趣,培养学生探索与研究的能力。
Abstract: With the development of the field of scientific research, the way of teaching and guiding knowledge has been broadened. As an important part of operation research, graph and network analysis has also ushered in the impact of new research fields, forcing teachers to implement exploratory teaching in education and teaching. Firstly, the teaching content of graph and network analysis is analyzed, and its limitations in solving real problems are introduced. Then, the complex network theory and its solution advantages are introduced, and the introduction of complex network theory to its exploratory teaching implementation process is analyzed. In this way, it stimulates students’ interest in learning and cultivates students’ ability to explore and research.
文章引用:王海英, 顾长贵, 刘媛华. 复杂网络理论在《运筹学》中的探究式应用研究——以图与网络分析为例[J]. 理论数学, 2024, 14(4): 276-284. https://doi.org/10.12677/pm.2024.144135

参考文献

[1] [美]欧内斯特∙博耶. 学术水平的反思-教授工作的重点领域[M]//吕达, 周满生. 当代外国教育改革著名文献(美国卷∙第三册). 北京: 人民教育出版社, 2004: 23.
[2] 王本陆. 课程与教学论[M]. 北京: 高等教育出版社, 2017: 259.
[3] 邱菀华, 冯允成, 魏法杰, 周泓, 刘美芳. 运筹学教程[M]. 北京: 机械工业出版社, 2009.
[4] 汪小帆, 李翔, 陈关荣. 网络科学导论[M]. 北京: 高等教育出版社, 2012.
[5] Strogatz, S.H. (2001) Exploring Complex Networks. Nature, 410, 268-276. [Google Scholar] [CrossRef] [PubMed]
[6] 百度百科. 复杂网络[EB/OL].
https://baike.baidu.com/item/复杂网络, 2024-04-23.
[7] 维基百科[EB/OL].
https://www.wikipedia.org/, 2024-04-23.
[8] Rossi, R.A. and Ahmed, N.K. (2014) Network Repository: A Graph Data Repository with Visual Interactive Analytics. arXiv: 1410.3560
[9] 马良. 基础运筹学教程[M]. 北京: 高等教育出版社, 2014.
[10] Nicosia, G. and Oriolo, G. (2003) An Approximate A* Algorithm and Its Application to the SCS Problem. Theoretical Computer Science, 290, 2021-2029. [Google Scholar] [CrossRef
[11] 王小娟. 超大规模图的最短路径距离近似算法[D]: [硕士学位论文]. 扬州: 扬州大学, 2016.
[12] 唐晋韬, 王挺, 王戟. 适合复杂网络分析的最短路径近似算法[J]. 软件学报, 2011, 22(10): 2279-2290.
[13] Tretyakov, K. and Armas-Cervantes, A. (2014) Fast Fully Dynamic Landmark-Based Estimation of Shortest Path Distances in Very Large Graphs. Proceedings of CIKM' 11, Glasgow Scotland, 24-28 October 2011, 1785-1794. [Google Scholar] [CrossRef
[14] Adamic L.A., Lukose R.M., Puniyani A.R., et al. (2001) Search in Power-Law Networks. Physical Review E, 64, 234-241. [Google Scholar] [CrossRef
[15] Kim, B.J., Yoon, C.N., Han, S.K., et al. (2002) Path Finding Strategies in Scale-Free Networks. Physical Review E, 65, 27-43. [Google Scholar] [CrossRef
[16] 张昕, 严沛, 郭阳, 王慧慧. 基于k-shell的复杂网络最短路径近似算法[J]. 计算机工程与应用, 2019, 55(14): 54-60. [Google Scholar] [CrossRef