A bundle-type algorithm for routing in telecommunication data networks
Book information
Description
To optimize the quality of service through a telecommunication network, we propose an algorithm based on Lagrangian relaxation. The bundle-type dual algorithm is adapted to the present situation, where the dual function is the sum of a polyhedral function (coming from shortest path problems) and of a smooth function (coming from the congestion function).
Similar books
Numerical optimization theoretical and practical aspects
2003 · DJVU
Towards Autonomous Robotic Systems: 12th Annual Conference, TAROS 2011, Sheffield, UK, August 31 – September 2, 2011. Proceedings
2011 · PDF
Fundamentals of Convex Analysis
2004 · PDF
Towards Autonomous Robotic Systems: 12th Annual Conference, TAROS 2011, Sheffield, UK, August 31 – September 2, 2011. Proceedings
2011 · PDF
Numerical Optimization: Theoretical and Practical Aspects
2006 · PDF
Numerical optimization. Theoretical and practical aspects
2006 · PDF
Numerical Optimization: Theoretical and Practical Aspects
2006 · PDF
Numerical Optimization: Theoretical and Practical Aspects
2006 · PDF