Skip to main navigation
Skip to search
Skip to main content
Princeton University Home
Help & FAQ
Home
Profiles
Research units
Facilities
Projects
Research output
Press/Media
Search by expertise, name or affiliation
Assigning traffic over essentially-least-cost paths
David T. Hunt
,
Alain L. Kornhauser
Operations Research & Financial Engineering
Research output
:
Contribution to journal
›
Article
›
peer-review
2
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Assigning traffic over essentially-least-cost paths'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Least-cost Path
100%
Best Route
40%
Single Origin
40%
Cost Threshold
40%
Commuters
20%
Graph Network
20%
Detour
20%
Path Problems
20%
Shortest Path
20%
Link Attributes
20%
Workplace
20%
Number of Paths
20%
Single-path
20%
Two-route Scenario
20%
Uncertainty Levels
20%
Traffic Assignment
20%
Residential Area
20%
Minimum Cost Path
20%
Origin-destination
20%
Equilibrium Path
20%
Disutility
20%
Origin-Destination Pairs
20%
Computer Science
Subnetwork
100%
Minimum Cost Path
100%
Destination Pair
100%
Residential Area
100%