Adaptive Branch and Bound for Efficient Solution of Mixed-Integer Programs Formulated with Big-M
Approved for public release; distribution is unlimited === This thesis describes three specialized branch-and-bound (B and B) algorithms for solving a mixed-integer program (MIP) that incorporates standard big-M constructs. The goal is to identify valid values for M that also lead to short solution...
| Main Author: | |
|---|---|
| Other Authors: | |
| Published: |
Monterey, California. Naval Postgraduate School
2012
|
| Online Access: | http://hdl.handle.net/10945/17370 |