Solving QoS Routing Problems by DCA
Authors:
- 1 January 2010
- book chapter
- Published by Springer Nature
- p. 460-470
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Conditions that impact the complexity of QoS routingIEEE/ACM Transactions on Networking, 2005
- The DC (Difference of Convex Functions) Programming and DCA Revisited with DC Models of Real World Nonconvex Optimization ProblemsAnnals of Operations Research, 2005
- Efficient algorithms for computing disjoint QoS paths2004
- Concepts of Exact QoS Routing AlgorithmsIEEE/ACM Transactions on Networking, 2004
- On the complexity of QoS routingComputer Communications, 2003
- An overview of constraint-based path selection algorithms for QoS routingIEEE Communications Magazine, 2002
- Efficient QoS partition and routing of unicast and multicast2002
- A continuous approch for globally solving linearly constrained quadraticOptimization, 2001
- A D.C. Optimization Algorithm for Solving the Trust-Region SubproblemSIAM Journal on Optimization, 1998
- Approximation Schemes for the Restricted Shortest Path ProblemMathematics of Operations Research, 1992