In addition, in consideration of the non-convex and non-concave nature of the combinational optimization sub-problem, the branch and bound technique is adopted to obtain or approximate the global optimal solution.
In addition, in consideration of the non-convex and non-concave nature of the combinational optimization sub-problem, the branch and bound technique is adopted to obtain or approximate the global optimal solution.
针对组合优化子问题的非凸非凹性，采用分支定界法，以求得或接近全局最优解。