Browsing Mathematics (Faculty of) by Subject "polyhedral theory"

Now showing items 1-3 of 3

FACES OF MATCHING POLYHEDRA

Pulleyblank, William R. (University of Waterloo, 2016-09-30)

Let G = (V, E, ~) be a finite loopless graph, let b=(bi:ieV) be a vector of positive integers. A feasible matching is a vector X = (x.: j e: E) J of nonnegative integers such that for each node i of G, the sum of ...
Relaxations of the Maximum Flow Minimum Cut Property for Ideal Clutters

Ferchiou, Zouhaier (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 ...
Sensitivity Analysis and Robust Optimization: A Geometric Approach for the Special Case of Linear Optimization

Im, Jiyoung (University of Waterloo, 2018-12-21)

In this thesis, we study the special case of linear optimization to show what may affect the sensitivity of the optimal value function under data uncertainty. In this special case, we show that the robust optimization ...