Browsing Theses by Subject "integer programming"
Now showing items 1-6 of 6
-
Comparing Intersection Cut Closures using Simple Families of Lattice-Free Convex Sets
(University of Waterloo, 2022-04-26)Mixed integer programs are a powerful mathematical tool, providing a general model for expressing both theoretically difficult and practically useful problems. One important subroutine of algorithms solving mixed integer ... -
A Comprehensive Analysis of Lift-and-Project Methods for Combinatorial Optimization
(University of Waterloo, 2014-08-20)In both mathematical research and real-life, we often encounter problems that can be framed as finding the best solution among a collection of discrete choices. Many of these problems, on which an exhaustive search in the ... -
Primal Cutting Plane Methods for the Traveling Salesman Problem
(University of Waterloo, 2017-04-26)Most serious attempts at solving the traveling salesman problem (TSP) are based on the dual fractional cutting plane approach, which moves from one lower bound to the next. This thesis describes methods for implementing ... -
Scalable and Highly Available Database Systems in the Cloud
(University of Waterloo, 2013-01-10)Cloud computing allows users to tap into a massive pool of shared computing resources such as servers, storage, and network. These resources are provided as a service to the users allowing them to “plug into the cloud” ... -
Two combinatorial problems from craniosynostosis
(University of Waterloo, 2022-09-08)The art of cranial vault remodelling surgery is amazing and fascinating, but remains much of that, an art, to this day. In this thesis, we provide two mathematical approaches to tackle cranial vault remodelling surgery, ... -
Using integer programming in finding t-designs
(University of Waterloo, 2012-04-26)A t-design is a combinatorial structure consisting of a collection of blocks over a set of points satisfying certain properties. The existence of t-designs given a set of parameters can be reduced to finding nonnegative ...