New dynamic programming algorithms for the resource constrained elementary shortest path problem

Title
New dynamic programming algorithms for the resource constrained elementary shortest path problem
Authors
Keywords
-
Journal
NETWORKS
Volume 51, Issue 3, Pages 155-170
Publisher
Wiley
Online
2007-12-15
DOI
10.1002/net.20212

Ask authors/readers for more resources

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started