CSpace

浏览/检索结果: 共7条,第1-7条 帮助

限定条件    
已选(0)清除 条数/页:   排序方式:
Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting 期刊论文
JOURNAL OF GLOBAL OPTIMIZATION, 2020, 卷号: 76, 期号: 4, 页码: 913-932
作者:  Jarre, Florian;  Lieder, Felix;  Liu, Ya-Feng;  Lu, Cheng
收藏  |  浏览/下载:134/0  |  提交时间:2020/05/24
Max-cut problem  Complex variables  Semidefinite relaxation  Unit modulus lifting  
A new fully polynomial time approximation scheme for the interval subset sum problem 期刊论文
JOURNAL OF GLOBAL OPTIMIZATION, 2017, 卷号: 68, 期号: 4, 页码: 749-775
作者:  Diao, Rui;  Liu, Ya-Feng;  Dai, Yu-Hong
收藏  |  浏览/下载:108/0  |  提交时间:2018/07/30
Interval subset sum problem  Computational complexity  Solution structure  Fully polynomial time approximation scheme  Worst-case performance  
Globally optimal solutions of max-min systems 期刊论文
JOURNAL OF GLOBAL OPTIMIZATION, 2007, 卷号: 39, 期号: 3, 页码: 347-363
作者:  Tao, Yuegang;  Liu, Guo-Ping;  Chen, Wende
收藏  |  浏览/下载:94/0  |  提交时间:2018/07/30
global optimization  high matrix  k(s) -control vector  max-min system  optimal max-only projection set  
On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems 期刊论文
JOURNAL OF GLOBAL OPTIMIZATION, 2005, 卷号: 33, 期号: 3, 页码: 369-391
作者:  Fang, SC;  Han, JY;  Huang, ZH;  Birbil, SI
收藏  |  浏览/下载:106/0  |  提交时间:2018/07/30
entropy function  finite termination  non-interior continuation method  vertical linear complementarity problems  smoothing approximation  
Conical partition algorithm for maximizing the sum of dc ratios 期刊论文
JOURNAL OF GLOBAL OPTIMIZATION, 2005, 卷号: 31, 期号: 2, 页码: 253-270
作者:  Dai, Y;  Shi, JM;  Wang, SY
收藏  |  浏览/下载:104/0  |  提交时间:2018/07/30
cutting plane  fractional programming  global optimization  outer approximation  sum of ratios  
Optimality and duality in nondifferentiable and multiobjective programming under generalized d-Invexity 期刊论文
JOURNAL OF GLOBAL OPTIMIZATION, 2004, 卷号: 29, 期号: 4, 页码: 425-438
作者:  Mishra, SK;  Wang, SY;  Lai, KK
浏览  |  Adobe PDF(98Kb)  |  收藏  |  浏览/下载:446/136  |  提交时间:2018/07/30
Duality  Generalized D-invexity  Multiobjective Programming  Optimality  Pareto Efficient Solution  
Improved approximation algorithms for MAX n/2-DIRECTED-BISECTION and MAX n/2-DENSE-SUBGRAPH 期刊论文
JOURNAL OF GLOBAL OPTIMIZATION, 2003, 卷号: 27, 期号: 4, 页码: 399-410
作者:  Xu, DC;  Han, JY;  Huang, ZH;  Zhang, LP
收藏  |  浏览/下载:106/0  |  提交时间:2018/07/30
MAX n/2-DIRECTED-BISECTION  MAX n/2-DENSE-SUBGRAPH  polynomial-time approximation algorithm  semidefinite programming