*********************************
There is now a CONTENT FREEZE for Mercury while we switch to a new platform. It began on Friday, March 10 at 6pm and will end on Wednesday, March 15 at noon. No new content can be created during this time, but all material in the system as of the beginning of the freeze will be migrated to the new platform, including users and groups. Functionally the new site is identical to the old one. webteam@gatech.edu
*********************************
Student: Andres Iroume
Title: Sparsity in Integer Programming
Advisors: Dr. Santanu Dey
Committee Members: Dr. Marco Molinaro (PUC Rio), Dr. David Goldsman, Dr. Alejandro Toriello and Dr. Andy Sun.
Date and time: Monday, December 12, 2016, noon (EST)
Location: Groseclose
Abstract: This thesis deals with understanding the effect of sparsity in integer programming. Chapter 1 corresponds to the introduction and outlay of the thesis, Chapter 2 deals with approximating polytopes using sparse cuts under various settings. Chapter 3 discusses a variant on feasibility pump that automatically detects and harnesses sparsity. Chapter 4 deals with the ratio of the number of integral extreme points to the total number of extreme points for a family of random polytopes. Chapter 5 discusses the strength of multi-row aggregation cuts in the context of sign- pattern integer programs (IPs).
