Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems.
Audrey CerqueusAnthony PrzybylskiXavier GandibleuxPublished in: Eur. J. Oper. Res. (2015)
Keyphrases
- knapsack problem
- bi objective
- upper bound
- lower bound
- binary variables
- combinatorial optimization problems
- optimal solution
- optimization problems
- multiple objectives
- linear programming relaxation
- exact algorithms
- np hard
- dynamic programming
- test problems
- worst case
- branch and bound algorithm
- nsga ii
- greedy algorithm
- branch and bound
- multi objective
- efficient solutions
- lower and upper bounds
- business intelligence
- optimization algorithm
- multi objective optimization
- linear functions
- minimum cost
- vehicle routing problem
- search space
- cost function
- objective function
- implicit enumeration