A combined DCA and Branch-and-Bound using a new convex quadratic underestimation for globally solving box constrained quadratic programming |

A combined DCA and Branch-and-Bound using a new convex quadratic underestimation for globally solving box constrained quadratic programming


Đánh giá bài viết

Đánh giá bài viết

Xem thêm