New approaches to integer programming
Integer Programming (IP) is a powerful and widely-used formulation for combinatorial problems. The study of IP over the past several decades has led to fascinating theoretical developments, and has improved our ability to solve discrete optimization problems arising in practice. This thesis makes pr...
| Main Author: | |
|---|---|
| Published: |
Georgia Institute of Technology
2012
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1853/44814 |