Randomized strategies for cardinality robustness in the knapsack problem.
Yusuke KobayashiKenjiro TakazawaPublished in: Theor. Comput. Sci. (2017)
Keyphrases
- knapsack problem
- optimal solution
- optimization problems
- combinatorial optimization problems
- test problems
- dynamic programming
- np hard problems
- np hard
- exact algorithms
- heuristic solution
- greedy algorithm
- multidimensional knapsack problem
- bicriteria
- continuous relaxation
- linear programming relaxation
- maximum profit
- multiple objectives
- implicit enumeration
- linear programming
- evolutionary algorithm