Shortest path problems are fundamental network optimization problems arising in many contexts and having a wide range of applications, including dynamic programming, project management, knapsack problems, routingin data networks, and transportation problems. The scope of this monography is to provide an extensive treatment of shortest path algorithms covering both classical and recently proposed approaches. Paola Festa is assistant professor in Operations Research at the Mathematics and applications Dept. of the University of Napoli “FEDERICO II”, Italy. She earned her PhD in Operations Research and has been Research Scholar at the Lab. for Information and Decision Systems of MIT (USA), at the Dept. of Industrial and Systems Engineering of University of Florida (USA), and the Algorithms and Optimization Research Dept. of AT&T Labs Research (USA). She authored and co–authored many research papers in Network Flow Problems, Discrete Optimization, and Hard Combinatorial Optimization Problems.
17 x 24
|data pubblicazione: ||Dicembre 2007|