连通最大k割问题的分支切割算法
A branch-and-cut algorithm for the connected max-k-cut problem
European Journal of Operational Research · 2023
被引 2
ABS 4
- Patrick Healy
- Nicolas Jozefowiez 通讯
- Pierre Laroche
- Franc Marchetti
- Sébastien Martin
- Zsuzsanna Róka
运筹学组合优化图论整数规划