期刊
CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH
卷 16, 期 2, 页码 111-125出版社
SPRINGER
DOI: 10.1007/s10100-007-0052-9
关键词
computational complexity; global optimization; linear and semidefinite programming; approximation algorithms
We consider the computational complexity of optimizing various classes of continuous functions over a simplex, hypercube or sphere. These relatively simple optimization problems arise naturally from diverse applications. We review known approximation results as well as negative (inapproximability) results from the recent literature.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据