| Article ID: | iaor20061809 |
| Country: | Netherlands |
| Volume: | 34 |
| Issue: | 1 |
| Start Page Number: | 58 |
| End Page Number: | 68 |
| Publication Date: | Jan 2006 |
| Journal: | Operations Research Letters |
| Authors: | Boland Natashia, Dumitrescu Irina, Dethridge John |
A label setting algorithm for solving the Elementary Resource Constrained Shortest Path Problem, using node resources to forbid repetition of nodes on the path, is implemented. A state-space augmenting approach for accelerating run times is considered. Several augmentation strategies are suggested and compared numerically.