On solving large-scale instances of the knapsack problem with setup by means of an iterated greedy algorithm.
Salim BouamamaChristian BlumPublished in: ICSC (2017)
Keyphrases
- greedy algorithm
- knapsack problem
- randomly generated test instances
- linear programming relaxation
- implicit enumeration
- greedy algorithms
- combinatorial optimization problems
- dynamic programming
- exact algorithms
- worst case
- greedy heuristic
- greedy strategy
- set cover
- objective function
- multidimensional knapsack problem
- influence maximization
- submodular functions
- cutting plane
- integer variables
- np hard
- optimal solution
- maximum profit
- lp relaxation
- link analysis
- influence spread
- genetic algorithm