摘要
在用“奇偶点图上作业法”求解“中国邮路问题”时,需检查图中的每一个回路.当图中回路较多时,检查不便且易出错.针对此,本文建立了求解“中国邮路问题”的0-1规划模型,并给出了算例。
It is required to check every circuit of a graph in order to find its Chinese postline by using operaton method on an odd-even vertex graph.The more circuits in the graph, the more complex to check and mere mistakes likely to make.Therefore, this paper presents a 0-1 programming model solving the Chinese postline problem and an application example.
出处
《北方交通大学学报》
CSCD
北大核心
1992年第1期65-70,共6页
Journal of Northern Jiaotong University
关键词
0-1规划
最短路
中国邮路问题
0-1 programming
shortest path
connected graph/Chinese postline problem
operation method on an odd-even vertex graph
