Algorithms for combinatorial optimization

组合优化算法

• 批准号: 341698-2007
• 负责人: Stephen, Tamon
• 金额: $ 1.24万
• 依托单位: Simon Fraser University
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2010
• 资助国家: 加拿大
• 起止时间: 2010-01-01 至 2011-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=458530
• 关键词: Algorithms; combinatorial; optimization

The aim of this project is to find efficient algorithms for combinatorial optimization problems. These problems arise in both theoretical and applied settings. The most famous problem of this type is the Travelling Salesman Problem, but many combinatorial optimization problems are linked through beautiful theory and common ideas. Combinatorial optimization problems are characterized by having a discrete search space. The challenge is that this space is nevertheless too large to enumerate completely, even with very fast computers, so intelligent algorithms and heuristics are required. Our aim is to find and analyze such algorithms.

该项目的目的是寻找组合优化问题的有效算法。 这些问题在理论和应用环境中都会出现。 此类中最著名的问题是旅行商问题，但许多组合优化问题都是通过优美的理论和共同的想法联系在一起的。 组合优化问题的特点是具有离散的搜索空间。 挑战在于，即使使用非常快的计算机，这个空间仍然太大而无法完全枚举，因此需要智能算法和启发式方法。 我们的目标是找到并分析此类算法。