A Parallel Large Neighborhood Search-Based Heuristic for the Disjunctively Constrained Knapsack Problem.
Mhand HifiStéphane NègreToufik SaadiSagvan SalehLei WuPublished in: IPDPS Workshops (2014)
Keyphrases
- knapsack problem
- optimal solution
- exact algorithms
- heuristic solution
- multidimensional knapsack problem
- constrained problems
- optimization problems
- randomly generated test instances
- greedy heuristic
- dynamic programming
- metaheuristic
- vehicle routing problem
- linear programming relaxation
- combinatorial optimization problems
- maximum profit
- np hard
- test problems
- tabu search
- cutting plane
- greedy algorithm
- lp relaxation
- combinatorial optimization
- objective function
- solution quality
- linear program
- continuous relaxation
- bicriteria
- special case
- lower bound
- heuristic methods
- vehicle routing
- feasible solution
- search space
- implicit enumeration
- decision variables
- linear programming