An iterative rounding strategy-based algorithm for the set-union knapsack problem.
Isma DahmaniMeriem FerroumMhand HifiPublished in: Soft Comput. (2021)
Keyphrases
- knapsack problem
- optimal solution
- linear programming relaxation
- dynamic programming
- test problems
- cost function
- np hard
- learning algorithm
- linear programming
- worst case
- exact algorithms
- computational complexity
- decomposition algorithm
- greedy heuristic
- bicriteria
- artificial immune system
- lower and upper bounds
- ant colony optimization
- combinatorial optimization problems
- optimization problems
- lower bound
- minimum cost
- neural network
- optimization algorithm
- shortest path problem
- decision variables
- simulated annealing
- special case
- evolutionary algorithm
- minimum length