Lagrangian relaxation and enumeration for solving constrained shortest‐path problems
Work
Year: 2008
Type: article
Abstract: The constrained shortest‐path problem (CSPP) generalizes the standard shortest‐path problem by adding one or more path‐weight side constraints. We present a new algorithm for CSPP that Lagrangianizes... more
Source: Networks
Institution Naval Postgraduate School
Cites: 29
Cited by: 84
Related to: 10
FWCI: 5.722
Citation percentile (by year/subfield): 96.01
Subfield: Transportation
Field: Social Sciences
Domain: Social Sciences
Open Access status: green