首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于最短路的设备更新问题的数学建模
引用本文:刘晓妍,麻兴斌,王晓明.基于最短路的设备更新问题的数学建模[J].河南教育学院学报(自然科学版),2013(4):10-13.
作者姓名:刘晓妍  麻兴斌  王晓明
作者单位:[1]山东科技大学公共课部,山东济南250031 [2]山东科技大学财经系,山东济南250031 [3]山东科技大学教科部,山东济南250031
基金项目:国家自然科学基金(71071089);山东省软科学研究计划项目(2012RKB01457);山东科技大学教育教学研究“群星计划”项目(QX2013398)
摘    要:最短路问题在大学生数学建模竞赛和实际生活中有着广泛的应用.介绍了最短路问题的定义、求解最短路的Dijkstra算法和0-1规划法.最后,给出设备更新问题的最短路数学模型求解过程.

关 键 词:数学建模  最短路问题  Dijkstra算法  0-1规划

Mathematical Modeling for Equipment Updating Based on Shortest Path
LIU Xiao-yan,MA Xing-bin,WANG Xiao-ming.Mathematical Modeling for Equipment Updating Based on Shortest Path[J].Journal of Henan Education Institute(Natural Science Edition),2013(4):10-13.
Authors:LIU Xiao-yan  MA Xing-bin  WANG Xiao-ming
Institution:1. Department of Public Courses, Shandong University of Science and Technology, Jinan 250031, China; 2. Department of Finance and Economics, Shandong University of Science and Technology, Jinan 250031, China; 3. Department of Education and Science, Shandong University of Science and Technology, Jinan 250031, China )
Abstract:The shortest path problem was applied in National Undergraduate Mathematical Contest and practical life widely. The definition of shortest path problem was introduced, Dijkstra algorithm and 0-1 programming method to solve the shortest path problem were given. A practical problem was given and calculated by these two methods.
Keywords:mathematical modeling  shortest path problem  Dijkstra algorithm  0-1 programming
本文献已被 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号