The Performance of the Modified Subgradient Algorithm on Solving the 0-1 Quadratic Knapsack Problem.
Aydin SipahiogluTugba SaraçPublished in: Informatica (2009)
Keyphrases
- experimental evaluation
- gradient projection
- optimization algorithm
- preprocessing
- computational complexity
- k means
- improved algorithm
- np hard
- dynamic programming
- computational cost
- combinatorial optimization
- times faster
- learning algorithm
- convergence rate
- optimization method
- detection algorithm
- input data
- computationally efficient
- simulated annealing
- worst case
- cost function
- significant improvement
- objective function
- segmentation algorithm
- np complete
- expectation maximization
- high accuracy
- knapsack problem
- recognition algorithm