An Integer Linear Programming Formulation and Branch-and-Cut Algorithm for the Capacitated m-Ring-Star Problem.
Hernán BerinskyPaula ZabalaPublished in: Electron. Notes Discret. Math. (2011)
Keyphrases
- dynamic programming
- learning algorithm
- objective function
- preprocessing
- optimization algorithm
- experimental evaluation
- significant improvement
- cost function
- np hard
- computational cost
- detection algorithm
- k means
- neural network
- linear programming
- particle swarm optimization
- search space
- convergence rate
- probabilistic model
- expectation maximization
- optimal solution
- clustering method
- ant colony optimization
- times faster
- iterative procedure