带容量限制的最小生成树问题:重新审视跳索引公式

The capacitated minimum spanning tree problem: revisiting hop-indexed formulations

Computers and Operations Research · 2004
被引 1
ABS 3
运筹学组合优化整数规划网络设计