Theory of linear and integer programming
Theory of linear and integer programming
Graphs: theory and algorithms
Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
Heuristic algorithms for multiconstrained quality-of-service routing
IEEE/ACM Transactions on Networking (TON)
Resource Constrained Shortest Paths
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Combinatorial optimization with rational objective functions
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Convex Optimization
TAMCRA: a tunable accuracy multiple constraints routing algorithm
Computer Communications
A simple efficient approximation scheme for the restricted shortest path problem
Operations Research Letters
IEEE Transactions on Computers
| Hi-index | 0.01 |
Given a network modeled as a graph G with each link associated with a cost and k weights, the Constrained Shortest Path (CSP(k)) problem asks for computing a minimum cost path from a source node s to a target node t satisfying pre-specified bounds on path weights. This problem is NP-hard. In this paper we propose a new approximation algorithm called GEN-LARAC for CSP(k) problem based on Lagrangian relaxation method. For k = 1, we show that the relaxed problem can be solved by a polynomial time algorithm with time complexity O((m + n log n)2). Using this algorithm as a building block and combing it with ideas from mathematical programming, we propose an efficient algorithm for arbitrary k. We prove the convergence of our algorithm and compare it with previously known algorithms. We point out that our algorithm is also applicable to a more general class of constrained optimization problems.