Article ID Journal Published Year Pages File Type
1143459 Operations Research Letters 2006 11 Pages PDF
Abstract

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.

Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Accelerated label setting algorithms for the elementary resource constrained shortest path problem
Authors
, , ,