Randomized Strategies for Cardinality Robustness in the Knapsack Problem.
Yusuke KobayashiKenjiro TakazawaPublished in: ANALCO (2016)
Keyphrases
- knapsack problem
- optimization problems
- combinatorial optimization problems
- optimal solution
- test problems
- dynamic programming
- multidimensional knapsack problem
- np hard problems
- linear programming relaxation
- exact algorithms
- np hard
- greedy heuristic
- multiple objectives
- greedy algorithm
- cutting plane
- heuristic solution
- continuous relaxation
- objective function
- bicriteria
- vehicle routing problem
- evolutionary algorithm
- search algorithm
- implicit enumeration
- neural network
- maximum profit