Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem.
Babacar ThionganeAnass NagihGérard PlateauPublished in: Discret. Appl. Math. (2006)
Keyphrases
- knapsack problem
- optimal solution
- exact algorithms
- heuristic solution
- randomly generated test instances
- greedy heuristic
- combinatorial optimization problems
- optimization problems
- test problems
- dynamic programming
- np hard
- linear programming relaxation
- feasible solution
- lower bound
- greedy algorithm
- multidimensional knapsack problem
- heuristic methods
- column generation
- production planning
- grasp with path relinking
- lagrangean relaxation
- cutting plane
- decision variables
- branch and bound
- linear programming
- bicriteria
- search algorithm
- maximum profit
- network design problem
- objective function
- machine learning
- implicit enumeration
- metaheuristic
- evolutionary algorithm
- upper bound
- branch and bound algorithm
- special case
- solution quality