Resource constrained shortest paths and extensions
In this thesis, we use integer programming techniques to solve the resource constrained shortest path problem (RCSPP) which seeks a minimum cost path between two nodes in a directed graph subject to a finite set of resource constraints. Although NP-hard, the RCSPP is extremely useful in practice and...
| Main Author: | |
|---|---|
| Published: |
Georgia Institute of Technology
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1853/28268 |