Advances in shortest path based column generation for integer programming
Branch-price-and-cut algorithms are among the most successful exact optimization approaches for solving many routing and scheduling problems. This is due, in part, to the availability of extremely efficient and effective dynamic programming algorithms for solving the pricing problem, and the availab...
| Main Author: | |
|---|---|
| Published: |
Georgia Institute of Technology
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1853/34761 |