Related references
Note: Only part of the references are listed.Lagrangian Relaxation and Enumeration for Solving Constrained Shortest-Path Problems
W. Matthew Carlyle et al.
NETWORKS (2008)
Models and algorithms for the traffic assignment problem with link capacity constraints
Y Nie et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2004)
Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem
I Dumitrescu et al.
NETWORKS (2003)
Traffic equilibrium problem with route-specific costs: formulation and algorithms
HK Lo et al.
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2000)
Share Paper
