Result: GEN-LARAC : A generalized approach to the constrained shortest path problem under multiple additive constraints

Title:
GEN-LARAC : A generalized approach to the constrained shortest path problem under multiple additive constraints
Authors:
YING XIAO, THULASIRAMAN, Krishnaiyan, GUOLIANG XUE
Source:
Algorithms and computation (16th international symposium, ISAAC 2005, Sanya, Hainan, China, December 19-21, 2005)0ISAAC 2005. :92-105
Publisher Information:
Berlin: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 24 ref 1
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Algorithme approximation, Approximation algorithm, Algoritmo aproximación, Complexité algorithme, Algorithm complexity, Complejidad algoritmo, Complexité temps, Time complexity, Complejidad tiempo, Multiplicateur Lagrange, Lagrange multiplier, Multiplicador Lagrange, Méthode Lagrange, Lagrangian method, Método Lagrange, Méthode polynomiale, Polynomial method, Método polinomial, Méthode relaxation, Relaxation method, Método relajación, Optimisation sous contrainte, Constrained optimization, Optimización con restricción, Plus court chemin, Shortest path, Camino más corto, Problème NP difficile, NP hard problem, Problema NP duro, Programmation mathématique, Mathematical programming, Programación matemática, Propagation trajet multiple, Multipath propagation, Propagación trayecto múltiple, Satisfaction contrainte, Constraint satisfaction, Satisfaccion restricción, Temps polynomial, Polynomial time, Tiempo polinomial, Théorie graphe, Graph theory, Teoría grafo
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
School of Computer Science, University of Oklahoma, 200 Felgar Street, Norman, OK 73019, United States
Arizona State University, Tempe, AZ 85287, United States
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=17394385
Rights:
Copyright 2006 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.17394385
Database:
PASCAL Archive

Further Information

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.