| 关于行遍性问题的研究 |
| |
| 引用本文： | 张淑艳,马超.关于行遍性问题的研究[J].白城师范学院学报,2010(6):16-20. |
| |
| 作者姓名： | 张淑艳 马超 |
| |
| 作者单位： | 白城师范学院数学系 |
| |
| 摘 要： | 以2010年东北三省数学建模联赛B题：走遍全中国为例,行遍中国的34个省会城市、直辖市及港澳台,考虑省钱、省时、方便的原则,用经纬度的地理坐标建立行遍问题的数学模型,给出最短路旅行路径方案和最经济的旅行订票方案.
|
| 关 键 词： | 行遍问题 最短路径 哈密顿图 旅行方案 综合评价 |
On Going-the-Round Problems |
| |
| ZHANG Shu-yan,MA Chao.On Going-the-Round Problems[J].Journal of Baicheng Normal College,2010(6):16-20. |
| |
| Authors: | ZHANG Shu-yan MA Chao |
| |
| Institution: | ZHANG Shu-yan,MA Chao(Depatrment of mathematics,Baicheng Normal College,Baicheng 137000,China) |
| |
| Abstract: | Taking Mofdeling Contest which was named " Across China" held by three provinces in Northest of China as an example,it made the competitors travel across 34 capital cities,municipalities and Hongkong and Macao.In order to save expenses,time and be convenient,we build the going-round maths models by geographic coordinates of latitude and longitude and provides the shortest travel path and the most economical way of booking tickets. |
| |
| Keywords: | going-the-round problem the shortest path Hamiltonian travel plan comprehensive evaluation |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
