.png){kind=icon}
返回
Approximation algorithms
.png){kind=icon}
OA
AI
DOI：10.1073/pnas.94.24.12734.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Increasing global competition, rapidly changing markets, and greater consumer awareness have altered the way in which corporations do business, To become more efficient, many industries have sought to model some operational aspects by gigantic optimization problems, It is not atypical to encounter models that capture 10(6) separate ''yes'' or ''no'' decisions to be made, Although one could, in principle, try all 2(106) possible solutions to find the optimal one, such a method would be impractically slow. Unfortunately, for most of these models, no algorithms are known that find optimal solutions with reasonable computation times, Typically, industry must rely on solutions of unguaranteed quality that are constructed in an ad hoc manner, Fortunately, for some of these models there are good approximation algorithms: algorithms that produce solutions quickly that are provably close to optimal, Over the past 6 years, there has been a sequence of major breakthroughs in our understanding of the design of approximation algorithms and of limits to obtaining such performance guarantees; this area has been one of the most flourishing areas of discrete mathematics and theoretical computer science.
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
P
IF:
9.1
论文数:
10.8W
被引数:
73.5W
机构
暂无机构信息
引用论文
Electrostatic Free Energy and Other Properties of States Having Nonequilibrium Polarization. I具有非平衡极化状态的静电自由能和其他性质。我
OAAI
.png){kind=icon}
OAAI分享收藏