Browsing Mathematics (Faculty of) by Supervisor "Guenin, Bertrand"
Now showing items 16 of 6

Comparing Intersection Cut Closures using Simple Families of LatticeFree Convex Sets
(University of Waterloo, 20220426)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 Generalization to Signed Graphs of a Theorem of Sergey Norin and Robin Thomas
(University of Waterloo, 20191219)In this thesis we characterize the minimal nonplanar extensions of a signed graph. We consider the following question: Given a subdivision of a planar signed graph (G, Σ), what are the minimal structures that can be added ... 
Ideal Clutters
(University of Waterloo, 20180424)Let E be a finite set of elements, and let C be a family of subsets of E called members. We say that C is a clutter over ground set E if no member is contained in another. The clutter C is ideal if every extreme point of ... 
Recognizing EvenCycle and EvenCut Matroids
(University of Waterloo, 20160427)Evencycle and evencut matroids are classes of binary matroids that generalize respectively graphic and cographic matroids. We give algorithms to check membership for these classes of matroids. We assume that the matroids ... 
Relaxations of the Maximum Flow Minimum Cut Property for Ideal Clutters
(University of Waterloo, 20210129)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 ... 
Representations of evencycle and evencut matroids
(University of Waterloo, 20210827)In this thesis, two classes of binary matroids will be discussed: evencycle and evencut matroids, together with problems which are related to their graphical representations. Evencycle and evencut matroids can be ...