- Constrained Shortest Path Problem: Lagrangian Relaxation-Based Algorithmic Approaches

Shortest path, minimum cost flow, and maximum flow computation are fundamental problems in operations research. Though interesting in their own right, algorithms for these problems also serve as building blocks in the design of algorithms for complex problems

encountered in large-scale industrial applications. So, over the years an extensive literature on various aspects of these problems emerged, which helped in problem solving in polynomial time. However, adding one or more additional additive constraints makes them intractable.