最大价值动态网络流调度问题的混合整数规划模型与启发式算法
Mixed-integer programming models and heuristic algorithms for the maximum value dynamic network flow scheduling problem
Computers and Operations Research · 2024
被引 3
ABS 3
- Tanner Nixon
- Robert M. Curry 通讯
- Phanuel Allaissem B.
运筹学整数规划网络流调度优化启发式算法