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

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

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.