Application of Lagrangian relaxation approach to α-reliable path finding in stochastic networks with correlated link travel times

A note on two problems in connexion with graphs

E. Dijkstra · Numerische Mathematik · 1959 · 23.8K citations

Natural Sciences, Computer Science, Mathematics +6

A Formal Basis for the Heuristic Determination of Minimum Cost Paths

Peter Hart, Nils J. Nilsson, Bertram Raphael · IEEE Transactions on Systems Science and Cybernetics · 1968 · 12.3K citations

Computing, Decision Sciences, Algorithms +15

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

Network flows: Theory, algorithms and applications

Discrete Applied Mathematics · 1994 · 2.6K citations

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