Fundamental properties of convex mixed-integer programs

Fundamental properties of convex mixed-integer programs

In this Ph.D. dissertation research, we lay the mathematical foundations of various fundamental concepts in convex mixed-integer programs (MIPs), that is, optimization problems where all the decision variables belong to a given convex set and, in addition, a subset of them are required to be integer...

Full description

Bibliographic Details
Main Author: Moran Ramirez, Diego Alejandro
Other Authors: Dey, Santanu S.
Format: Others
Language:en_US
Published: Georgia Institute of Technology 2014
Subjects:
Integer programming
Cutting planes
Convex hull
Integer hull
Optimization
Split cuts
Online Access:http://hdl.handle.net/1853/52309

Internet

http://hdl.handle.net/1853/52309

Similar Items