Grant: Alliance Grants
University of Lethbridge
$24,987.00
Algorithms and lower bounds for monotone dualization and tensor decomposition of constraint satisfaction hypergraphs
EF 2022-23
Résumé
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.
Programme
Alliance Grants
Bénéficiaire
Emplacement
Alberta, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
576241-2022
Name nom
Gaur, Daya DR
Department département
Mathematics and Computer Science
Organization id
12
Institution établissement
University of Lethbridge
Province en
Alberta
Province fr
Alberta
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2022
Competition year année de concours
2022
Award amount
24987
Program id
ALLRP
Program name en
Alliance Grants
Program name fr
Subventions Alliance
Group en
RESEARCH PARTNERSHIPS
Group fr
PARTENARIATS DE RECHERCHE
Committee code
96
Committee name en
RPP Internal Decision Cttee
Committee name fr
Cté de décision interne - PPR
Area of application code
1200
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Advancement of knowledge
Area of application fr
Avancement des connaissances
Research subject code
2713
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Algorithms
Research subject fr
Algorithmes
Installment
inst:1
Partie
1
Nb partie
1
Application title
Algorithms and lower bounds for monotone dualization and tensor decomposition of constraint satisfaction hypergraphs
Application summary
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.
