最大最小$$k_i$$ k_i -划分问题的约简准则、上界及基于动态规划的启发式算法
Reduction criteria, upper bounds, and a dynamic programming based heuristic for the max–min $$k_i$$ k i -partitioning problem
Journal of Heuristics · 2017
被引 3
ABS 3
- Alexander Lawrinenko
- Stefan Schwerdfeger
- Rico Walter 通讯
运筹学组合优化动态规划启发式算法图划分