Canada Spends Logo

Explorez notre analyse du budget 2026

Grant: Discovery Grants Program - Individual

École Polytechnique de Montréal

$28,000.00

""Counting-Based Search in Constraint Programming: Ongoing Design, Analysis, and Application to Solve Practical Combinatorial Satisfaction and Optimization Problems""

EF 2012-13

Résumé
Many planning and scheduling problems arising in industry and public services are challenging to solve satisfactorily, especially if we have limited time to solve them. The solutions actually implemented could typically be improved to achieve better services, higher efficiency, or increased profit. This research is about one computational approach to solve such problems, called Constraint Programming. By improving the way we search for solutions, we may reach better solutions in reasonable time.
Programme
Discovery Grants Program - Individual
Emplacement
Quebec, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data

Tel que publié

Application id
218028-2012
Name nom
Pesant, Gilles
Department département
Génie informatique et génie logiciel
Organization id
64
Institution établissement
École Polytechnique de Montréal
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2012
Competition year année de concours
2012
Award amount
28000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
520
Area of application group en
Manufacturing processes and products
Area of application group fr
Procédés et produits industriels
Area of application en
Production and operations management
Area of application fr
Production et gestion des opérations
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
Partie
1
Nb partie
5
Application title
""Counting-Based Search in Constraint Programming: Ongoing Design, Analysis, and Application to Solve Practical Combinatorial Satisfaction and Optimization Problems""
Keyword
NSERC
Application summary
Many planning and scheduling problems arising in industry and public services are challenging to solve satisfactorily, especially if we have limited time to solve them. The solutions actually implemented could typically be improved to achieve better services, higher efficiency, or increased profit. This research is about one computational approach to solve such problems, called Constraint Programming. By improving the way we search for solutions, we may reach better solutions in reasonable time.