Two-phases Method and Branch and Bound Procedures to Solve the Bi-objective Knapsack Problem.
M. ViséeJacques TeghemMarc PirlotEkunda L. UlunguPublished in: J. Glob. Optim. (1998)
Keyphrases
- knapsack problem
- implicit enumeration
- branch and bound
- cost function
- bi objective
- optimal solution
- optimization problems
- branch and bound method
- combinatorial optimization
- evolutionary algorithm
- dynamic programming
- upper bound
- lower bound
- special case
- multi objective
- particle swarm optimization
- branch and bound algorithm
- computational complexity
- combinatorial optimization problems
- search algorithm
- branch and bound procedure
- neural network