Fixed Set Search Matheuristic Applied to the min-Knapsack Problem with Compactness Constraints and Penalty Values.
Ahmet CürebalStefan VoßRaka JovanovicPublished in: MIC (2) (2024)
Keyphrases
- knapsack problem
- decision variables
- objective function
- combinatorial optimization problems
- optimal solution
- np hard
- dynamic programming
- scheduling problem
- constraint satisfaction
- convex hull
- multiple objectives
- linear constraints
- exact algorithms
- search algorithm
- solution space
- heuristic methods
- learning algorithm
- binary variables
- integer variables