A cut-and-branch algorithm for the Quadratic Knapsack Problem.
Franklin Djeumou FomeniKonstantinos KaparisAdam N. LetchfordPublished in: Discret. Optim. (2022)
Keyphrases
- experimental evaluation
- learning algorithm
- detection algorithm
- objective function
- single pass
- improved algorithm
- optimization algorithm
- dynamic programming
- k means
- preprocessing
- significant improvement
- computational cost
- theoretical analysis
- search space
- optimal solution
- cost function
- computational complexity
- convergence rate
- path planning
- matching algorithm
- input data
- segmentation algorithm
- computationally efficient
- worst case
- np hard