灾情巡视的最佳路线被引量：2

原文传递

导出

摘要今年夏季,我国长江、松花江流域的广大地区遭受了特大水灾。作为以1998年全国大学生数学建模竞赛B题的“灾情巡视路线”问题就是在这样的背景下构思而成的。本文中,我们将结合答卷评阅情况,简单介绍一些有关该题解答的要点.

作者丁颂康

机构地区上海海运学院

出处《数学的实践与认识》 CSCD 1999年第1期74-78,共5页 Mathematics in Practice and Theory

关键词灾情巡视路线最佳路线组合优化旅行商

同被引文献16

1G. B. Dantzig, R Fulkerson. Solution of a largeTscale traveling-salesman problemJ]. Operations Research, 1954, 2:393 - 4i0.
2M. M. Flood. The Traveling-Salesman Problem[J]. Opera- tions Research, 1956, 4: 61-75.
3G. A. Croes. A method for solving traveling-salesman problems[J]. Operations Research, 1958, 6: 791-812.
46. B. Dantzig, D. R. Fulkerson. On a linear-progranning, combinatorial approach to the traveling salesman problem [J]. Operations Research, 1959, 7(t): 58-66.
5A. H. Land, A. G. Doig. An automatic method of solving discrete programming problems[J]. Eeonometrica, 1960, 28 (3) : 497-520.
6C.E. Miller, A.W. Tucker, and R.A. Zemlin, Integer programming formulation of traveling salesman problems", Journal of the Association for Computing Machinery, 1960 (7), 326-329.
7J. D. C. Little, K. G. Murty, D. W. Sweeney. An algo- rithm for the traveling salesman prob]emEJ]. Operations research, 1963(11), 972-989.
8R. L. Karg, G. L. Thompson. A heuristic approach to solving travelling salesman problems[J]. Management Science, 1964(lO), 225-248.
9S.Lin. ComDuter Solution of the Traveling Salesman Problem[J]. The Bell System Technical 7ournal, 1965, @i (10): 2245-2289.
10M. Bellmore, G. L. Nemhauser. The traveling salesman problem: a survey[J], Operations Research 1968(16), 538-558.

数学的实践与认识

1999年第1期

内容加载中请稍等...