Convergence results on the stable states of a Gravitational Swarm solving the Graph Coloring Problem.
Manuel GrañaIsrael Rebollo RuizPublished in: NaBIC (2013)
Keyphrases
- initial conditions
- particle swarm optimization
- graph coloring
- gauss seidel method
- proximal point algorithm
- swarm intelligence
- convergence rate
- search space
- convergence speed
- linear programming
- linear complementarity problem
- state variables
- combinatorial problems
- state transition
- linear equations
- dynamic programming
- markov decision problems
- stochastic shortest path
- np hard
- neural network