An approximation algorithm for network design problems with downwards-monotone demand functions.
Michael J. LaszloSumitra MukherjeePublished in: Optim. Lett. (2008)
Keyphrases
- worst case
- dynamic programming
- network flow
- neural network
- message passing
- ant colony optimization
- linear programming
- simulated annealing
- np hard
- cost function
- computational complexity
- objective function
- probabilistic model
- particle swarm optimization
- optimal solution
- convex hull
- benchmark problems
- approximation algorithms
- genetic algorithm