具有附加析取冲突约束的一对多最短路径问题的高效分支定界算法

An efficient branch-and-bound algorithm for the one-to-many shortest path problem with additional disjunctive conflict constraints

• Bahadır Pamuk
• Temel Öncan
• İ. Kuban Altınel 通讯