University of British Columbia
Scheduling the sports of Canada West : a tale of two discrete optimization models
Abstract
dc:descriptionMixed Integer Programming (MIP) and Constraint Programming (CP) are two of the most influential discrete optimization strategies available to practitioners. They can be applied to many of the same problems, yet they operate on two very different paradigms. MIP relies on the convexity of a collection of linear inequalities while CP employs global constraints while processing the search space. This thesis provides a thorough description of implementing a generic sports scheduling model using both MIP and CP. The goal is to clearly contrast the implementation of the model in the two strategies. The strategies are then analyzed with performance profiles based on real sports scheduling problems. Modeling real world problems requires a deep understanding of the structure of the problem. Exploiting the structure of a particular problem is key to modeling discrete optimization problems effectively. We demonstrate this idea by testing a constraint that exploits an implicit structure of sports leagues schedule.
Degree
thesis:*- Name thesis:degree_name
- Master of Science - MSc
- Level thesis:degree_level
- master's
- Discipline thesis:degree_discipline
- Mathematics
- Grantor dc:publisher
- University of British Columbia
- Year dc:date
- 2020
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Jolin-Landry, Charles
Rights
dc:rights- Statement dc:rights
-
- Attribution-NonCommercial-NoDerivatives 4.0 International
- Language dc:language
- eng
Identifiers
dc:identifier.*- Handle dc:identifier
- http://hdl.handle.net/2429/76376