An Exact Algorithm for the Biobjective 0-1 Linear Knapsack Problem with a Single Continuous Variable.
Hongtao LiuPublished in: PDCAT (2017)
Keyphrases
- knapsack problem
- bi objective
- continuous variables
- exact algorithms
- combinatorial optimization problems
- shortest path problem
- integer variables
- multiple objectives
- optimal solution
- set covering problem
- test problems
- optimization problems
- dynamic programming
- dynamic systems
- minimum cost flow
- branch and bound algorithm
- np hard
- greedy algorithm
- multi objective
- nsga ii
- multi objective optimization
- routing problem
- structure learning
- global optimization
- computationally expensive
- random variables
- lower bound
- bayesian networks