Exact algorithm for bi-objective 0-1 knapsack problem.
Fariborz JolaiMustafa Jahangoshai RezaeeMasoud RabbaniJafar RazmiParviz FattahiPublished in: Appl. Math. Comput. (2007)
Keyphrases
- knapsack problem
- bi objective
- optimal solution
- dynamic programming
- exact algorithms
- np hard
- combinatorial optimization problems
- multi objective
- cost function
- test problems
- objective function
- benchmark problems
- bicriteria
- optimization algorithm
- ant colony optimization
- optimization problems
- multiple objectives
- shortest path problem
- worst case
- greedy heuristic
- multidimensional knapsack problem
- implicit enumeration
- simulated annealing
- exact solution
- network design
- efficient solutions
- special case
- computational complexity