Cutting Planes for Large Mixed Integer Programming Models
In this thesis I focus on cutting planes for large Mixed Integer Programming (MIP) problems. More specifically, I focus on two independent cutting planes studies. The first of these deals with cutting planes for the Traveling Salesman Problem (TSP), and the second with cutting planes for general MIP...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | en_US |
| Published: |
Georgia Institute of Technology
2007
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1853/13956 |