Computing and Selecting ε-Efficient Solutions of {0, 1}-Knapsack Problems.
Emilia TantarOliver SchützeJosé Rui FigueiraCarlos A. Coello CoelloEl-Ghazali TalbiPublished in: MCDM (2008)
Keyphrases
- efficient solutions
- knapsack problem
- bicriteria
- optimal solution
- bi objective
- combinatorial optimization problems
- optimization problems
- test problems
- heuristic methods
- dynamic programming
- linear programming relaxation
- exact algorithms
- greedy algorithm
- np hard
- production planning
- cutting plane
- linear programming
- np hard problems
- implicit enumeration
- nsga ii
- multiple objectives
- reinforcement learning
- evolutionary algorithm
- lower bound
- objective function