Algorithms and lower bounds for monotone dualization and tensor decomposition of constraint satisfaction hypergraphs

约束满足超图的单调对偶化和张量分解的算法和下界

• 批准号: 576241-2022
• 负责人: Gaur, DayaDR
• 金额: $ 1.82万
• 依托单位: University of Lethbridge
• 依托单位国家: 加拿大
• 项目类别: Alliance Grants
• 财政年份: 2022
• 资助国家: 加拿大
• 起止时间: 2022-01-01 至 2023-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=758707
• 关键词: Algorithms; lower; bounds; monotone; dualization

We use computational tools every day to solve optimization problems in all areas of life, including supply chain management and disaster evacuations and planning. This research will improve the efficiency of the underlying computational tools used by the industry. As part of this research, we will develop efficient methods for constraint satisfaction. In turn, we will be able to plan, manage and search for efficiencies better. This research will lead to a new international research partnership between Canada and UK.

我们每天都使用计算工具来解决生活各个领域的优化问题，包括供应链管理以及灾难疏散和规划。这项研究将提高行业使用的底层计算工具的效率。作为这项研究的一部分，我们将开发有效的约束满足方法。反过来，我们将能够更好地规划、管理和寻求效率。这项研究将导致加拿大和英国之间建立新的国际研究伙伴关系。