Approximation and Exact Algorithms for Special Cases of Connected f-Factors.
N. S. NarayanaswamyC. S. RahulPublished in: CSR (2015)
Keyphrases
- exact algorithms
- approximation algorithms
- special case
- np hard
- benchmark instances
- vehicle routing problem with time windows
- knapsack problem
- benders decomposition
- network design problem
- computational problems
- neural network
- worst case
- nonlinear programming
- exact solution
- computational complexity
- particle swarm optimization
- combinatorial optimization problems
- dynamic programming
- search algorithm
- learning algorithm