Browsing Combinatorics and Optimization by Subject "optimization"
Now showing items 1-7 of 7
-
Computing with Multi-Row Intersection Cuts
(University of Waterloo, 2017-05-16)Cutting planes are one of the main techniques currently used to solve large-scale Mixed-Integer Linear Programming (MIP) models. Many important cuts used in practice, such as Gomory Mixed-Integer (GMI) cuts, are obtained ... -
Convex Algebraic Geometry Approaches to Graph Coloring and Stable Set Problems
(University of Waterloo, 2021-08-23)The objective of a combinatorial optimization problem is to find an element that maximizes a given function defined over a large and possibly high-dimensional finite set. It is often the case that the set is so large that ... -
Error Bounds and Singularity Degree in Semidefinite Programming
(University of Waterloo, 2020-01-24)An important process in optimization is to determine the quality of a proposed solution. This usually entails calculation of the distance of a proposed solution to the optimal set and is referred to as forward error. ... -
An integrated personnel allocation and machine scheduling problem for industrial size multipurpose plants
(Elsevier, 2018-01-01)This paper describes the development and implementation of an optimization model to solve the integrated problem of personnel allocation and machine scheduling for industrial size multipurpose plants. Although each of these ... -
Linear Programming Tools and Approximation Algorithms for Combinatorial Optimization
(University of Waterloo, 2010-01-05)We study techniques, approximation algorithms, structural properties and lower bounds related to applications of linear programs in combinatorial optimization. The following "Steiner tree problem" is central: given a graph ... -
Relaxations of the Maximum Flow Minimum Cut Property for Ideal Clutters
(University of Waterloo, 2021-01-29)Given a family of sets, a covering problem consists of finding a minimum cost collection of elements that hits every set. This objective can always be bound by the maximum number of disjoint sets in the family, we refer ... -
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, ...