排序方式: 共有2条查询结果,搜索用时 15 毫秒
1
1.
2.
A new efficient branch and bound method is proposed for solving convex programs with an additional monotonic nonconvex constraint. Computational experiments demonstrated that this method is quite practical for solving rank k reverse convex programs with much higher values of k than previously considered in the literature and can be applied to a wider class of nonconvex problems. 相似文献
1