A Fast Combinatorial Algorithm for the Bilevel Knapsack Problem with Interdiction Constraints.
Noah WeningerRicardo FukasawaPublished in: IPCO (2023)
Keyphrases
- knapsack problem
- dynamic programming
- np hard
- implicit enumeration
- optimal solution
- learning algorithm
- test problems
- greedy heuristic
- objective function
- worst case
- np hard problems
- bicriteria
- search space
- decision variables
- constrained optimization
- neural network
- multidimensional knapsack problem
- maximum flow
- max min
- exact algorithms
- bi objective
- particle swarm optimization
- cost function
- lower and upper bounds
- ant colony optimization
- optimization problems
- upper bound