Approximation algorithms for optimization problems

优化问题的近似算法

• 批准号: RGPIN-2015-04667
• 负责人: SolisOba, Roberto
• 金额: $ 1.31万
• 依托单位: University of Western Ontario
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2017
• 资助国家: 加拿大
• 起止时间: 2017-01-01 至 2018-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=634895
• 关键词: Approximation; algorithms; optimization; problems

Combinatorial optimization deals with finding optimum solutions for problems of a discrete and finite nature. Such problems arise in areas as diverse as Computer Science, Mathematics, Finances, Biology, Medicine, and Operations Research, among others. Many of these problems are too complex to solve without the use of computers and, therefore, efficient algorithms for solving them are needed.

组合优化涉及找到离散和有限性质问题的最佳解决方案。此类问题出现在计算机科学，数学，财务，生物学，医学和运营研究等多样化的领域。这些问题中的许多问题太复杂了，无法在不使用计算机的情况下解决，因此需要有效的算法来解决它们。