A polynomial-time algorithm for the weighted link ring loading problem with integer demand splitting.
Q. Q. NongT. C. Edwin ChengC. T. NgPublished in: Theor. Comput. Sci. (2010)
Keyphrases
- computational complexity
- worst case
- special case
- high accuracy
- learning algorithm
- improved algorithm
- detection algorithm
- cost function
- experimental evaluation
- strongly polynomial
- recognition algorithm
- ant colony optimization
- theoretical analysis
- dynamic programming
- objective function
- significant improvement
- k means
- simulated annealing
- input data
- search space
- association rules
- preprocessing
- convex hull
- weighted graph
- reinforcement learning
- minimum cost flow
- similarity measure