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

在电子表上求解最短路问题的研究
引用本文:关文忠.在电子表上求解最短路问题的研究[J].重庆三峡学院学报,2009,25(3):23-24.
作者姓名:关文忠
作者单位:重庆三峡学院经济与管理学院,重庆万州,404000
基金项目:重庆三峡学院院级项目《运筹学电子表模型软件》阶段性研究成果 
摘    要:图论是运筹学的一个重要分支,各点间最短路是图论重要内容之一,其直接应用是求解单服务设施布点(网络的中心或重心)及多服务设施布点问题.各点间最短路可采取矩阵算法,但并非简单的矩阵的和、积与逆,不能直接使用电子表函数.本文通过函数的组合,探讨利用Excel求解最短路问题的更为简便的操作方法.

关 键 词:图论  各点间最短路  Excel解法

A Study on Solving the Shortest Path Problem in the Electronic Form
GUAN Wen-zhong.A Study on Solving the Shortest Path Problem in the Electronic Form[J].JOurnal of Chongqing Three Gorges University,2009,25(3):23-24.
Authors:GUAN Wen-zhong
Institution:Economy and Management College;Chongqing Three Gorges University;Wanzhou 404000;Chongqing
Abstract:The shortest path between points is one of the important elements of graph theory that is an important branch of operations research,and its direct application is the solution of single-service points(the center or focus of the network) and multi-service facility layout problem.To work out the shortest path between the points,the method of matrix algorithm can be taken,but it is not the simple matrix sum,product and inversion,and the electronic forms cannot be directly applied.Based on a combination of func...
Keywords:graph theory  shortest path between points  Excel solution  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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