Finding the most reliable path with and without link travel time correlation: A Lagrangian substitution based approach

Network Flows: Theory, Algorithms, and Applications.

David K. Smith, Ravindra K. Ahuja, Thomas L. Magnanti et al. · Journal of the Operational Research Society · 1994 · 8.2K citations · Full text

Computing, Computer Science, Computer Networks +10

The Lagrangian Relaxation Method for Solving Integer Programming Problems

Marshall L. Fisher · Management Science · 1981 · 2.1K citations

Business, Mathematics, Operations Management +17

THE SCHEDULING OF CONSUMER ACTIVITIES: WORK TRIPS

Kenneth A. Small · American Economic Review · 1982 · 1.1K citations

Planning, Transportation Planning, Urban Planning +12

Route choice modeling: past, present and future research directions

Carlo Giacomo Prato · Journal of Choice Modelling · 2009 · 483 citations · Full text

Planning, Decision Sciences, Transportation Planning +17

A dual algorithm for the constrained shortest path problem

Gabriel Y. Handler, Israël Zang · Networks · 1980 · 454 citations

Natural Sciences, Transportation Planning, Algorithms +16