Algorithms and Cutting Planes for Mixed Integer Programs
<p> This dissertation is devoted to solving general mixed integer optimization problems. Our main focus is understanding and developing strong cutting planes for mixed integer linear programs through Gomory and Johnson's <i> k</i>-dimensional infinite group relaxation. Each c...
| Main Author: | |
|---|---|
| Language: | EN |
| Published: |
University of California, Davis
2013
|
| Subjects: | |
| Online Access: | http://pqdtopen.proquest.com/#viewpdf?dispub=3596887 |