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.