2018年 第5卷 第4期
《工程管理前沿（英文）》 >> 2018年 第5卷 第4期 doi: 10.15302/J-FEM-2018031
Maximum independent set in planning freight railway transportation
下一篇 上一篇
摘要
This work is devoted to the problem of planning of freight railway transportation. We define a special conflict graph on the basis of a set of acceptable train routes. The investigation aims to solve the classical combinatorial optimization problem in relation to the maximum independent set of vertices in undirected graphs. The level representation of the graph and its tree are introduced. With use of these constructions, the lower and upper bounds for the number of vertices in the maximum independent set are obtained.
京公网安备 11010502051620号
