课题基金 / 基金详情

Design and Analysis of Algorithms - New Paradigms, Methodologies and Applications

Design and Analysis of Algorithms - New Paradigms, Methodologies and Applications
算法的设计和分析——新范式、方法论和应用
批准号:
0515221
负责人:
Michel Goemans
金额:
$20.0万
依托单位国家:
美国
项目类别:
Continuing Grant
财政年份:
2005
资助国家:
美国
项目状态:
已结题
起止时间:
2005-08-01 至 2008-07-31

项目摘要

项目成果

Michel Goemans的其他基金

相似基金

相关文献

中文摘要
翻译
在各个行业中出现的许多优化问题,包括物流,生产计划,运输和电信,必须以自动化的方式反复解决。在许多情况下,基本的数学优化问题是可证明困难的,并且不能在合理的时间内解决最优性。因此,算法设计者的任务是开发有效的算法,并在每次运行时提供良好的解决方案,因为即使只有一次远离最佳解决方案也可能是灾难性的,无论是在所获得的解决方案的成本方面,还是在其无法满足需求或其他约束方面。这就强调了为困难的组合优化问题设计有效算法的重要性,这些算法可以保证解决方案可能接近最优。近似算法的这一领域在过去十年中有了巨大的增长,并产生了许多新的结果。该建议的智力价值是开发新的方法和技术,为算法设计者提供设计近似算法的工具,并专注于关键问题。这些问题包括基本问题,如旅行商问题和其他网络问题,这些问题在许多工业环境中作为构建模块出现。一个特别强调的是,数据随着时间的推移而演变的设置和算法的任务是提供一个不断变化的解决方案,以满足波动的要求。这一解决方案需要能够抵御这些波动,并在任何时候都保持接近最佳状态。这一提议的更广泛影响是为工业提供了提高生产力和更有效地利用可用资源的工具,这反过来将对经济产生影响。该提案还为研究生的培训寻求资金,这对于保持我们劳动力的竞争力并保证为在我们大学校园教学的下一代教师提供最好的培训非常重要。
英文摘要
Many optimization problems that arise in various industries, including logistics, production planning, transportation and telecommunication, have to be solved repeatedly and in automated fashion. In many cases, the underlying mathematical optimization problem is provably hard, and cannot be solved to optimality in a reasonable amount of time. As a result, the task of the algorithm designer is to develop algorithms that are efficient and provide good solutions on every single run, as a far from optimum solution even just once might be catastrophic, either in terms of the cost of the solution obtained or in terms of its inability to meet demands or other constraints. This stresses the importance of designing efficient algorithms for hard combinatorial optimization problems that deliver solutions guaranteed to be probably close to the optimum. This area of approximation algorithms has seen a tremendous growth in the last decade, with a host of new results. The intellectual merit of this proposal is to develop new methodologies and techniques to provide the algorithm designer with the tools to design approximation algorithms and is also to focus on crucial problems. These problems include fundamental problems such as the traveling salesman problem and other network problems which arise as building blocks in many industrial settings. A special emphasis will be given to settings in which the data evolves over time and the algorithm's task is to provide a constantly changing solution to meet the fluctuating requirements. This solution needs to be robust against these fluctuations, and remain close to optimum at any time.The broader impact of this proposal is to provide industry with the tools to bemore productive and more efficiently use the available resources, and this in turn will have an impact on the economy. The proposal also seeks funds for the training of graduate students and this is important to maintain the competitively of our workforce and guarantee the best possible training for the next generation of faculty members teaching on our college campuses.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
AF: Small: New Approaches to Fundamental Problems in Network Design
Polyhedral Techniques for the Design of Approximation Algorithms
Conference Proposal: CRM Theme Semester on Combinatorial Optimization (June 2006 - December 2006)
Design of Improved Approximation Algorithms for Combinatorial Optimization Problems
国内基金
海外基金
Scalable Learning and Optimization: High-dimensional Models and Online Decision-Making Strategies for Big Data Analysis
Intelligent Patent Analysis for Optimized Technology Stack Selection:Blockchain BusinessRegistry Case Demonstration
  • 批准号:
    --
  • 项目类别:
    外国学者研究基金项目
  • 资助金额:
    --
  • 批准年份:
    2024
  • 负责人:
    USHARANI HAREESH GOVINDARA JAN
  • 依托单位:
基于Meta-analysis的新疆棉花灌水增产模型研究
  • 批准号:
    41601604
  • 项目类别:
    青年科学基金项目
  • 资助金额:
    22.0万元
  • 批准年份:
    2016
  • 负责人:
    赵爱琴
  • 依托单位:
大规模微阵列数据组的meta-analysis方法研究
  • 批准号:
    31100958
  • 项目类别:
    青年科学基金项目
  • 资助金额:
    20.0万元
  • 批准年份:
    2011
  • 负责人:
    赵洪雅
  • 依托单位: