A Polynomial Time Local Propagation Algorithm for General Dataflow Constraint Problems.
Gilles TrombettoniPublished in: CP (1998)
Keyphrases
- special case
- learning algorithm
- randomly generated
- cost function
- optimization algorithm
- computational complexity
- search space
- computational efficiency
- np hard
- worst case
- optimal solution
- np complete
- upper bound
- dynamic programming
- linear programming
- particle swarm optimization
- k means
- combinatorial optimization
- qualitative and quantitative
- search algorithm
- particle swarm optimization algorithm
- polynomial time complexity