Back to search

Georgia Institute of Technology

Theory and computation of sparse cutting planes

Abstract

dc:description.abstract

Cutting plane plays an important role in the theory and computation of integer programming. Nowadays, most state-of-the-art integer programming solvers tend to bias their cutting plane selection towards sparse ones, which emphasizes the significance of sparse cutting planes. In this thesis, we conduct a comprehensive study of sparse cutting planes and prove several theoretical results. We also develop a new approximation algorithm for sparse packing integer programs.

Degree

thesis:*
Level thesis:degree_level
Doctoral
Department dc:contributor.department
Industrial and Systems Engineering
Grantor dc:publisher
Georgia Institute of Technology
Year dc:date.issued
2016

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Wang, Qianyi
Advisor dc:contributor.advisor
  • Dey, Santanu S.
Committee members dc:contributor.committeemember
  • Molinaro, Marco
  • Nemhauser, George
  • Ahmed, Shabbir
  • Sun, Andy

Subjects

dc:subject × 5

Rights

Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Handle dc:identifier.uri
http://hdl.handle.net/1853/56307

Chain of custody

source
Harvested from
Georgia Tech
Base URL
repository.gatech.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Wang, Qianyi. Theory and computation of sparse cutting planes. Doctoral thesis, Georgia Institute of Technology, 2016. http://hdl.handle.net/1853/56307