Core problems in bi-criteria {0, 1}-knapsack problems.
Carlos Gomes da SilvaJoão C. N. ClímacoJosé Rui FigueiraPublished in: Comput. Oper. Res. (2008)
Keyphrases
- knapsack problem
- bicriteria
- test problems
- optimization problems
- combinatorial optimization problems
- np hard problems
- efficient solutions
- exact algorithms
- integer linear programming
- location problems
- optimal solution
- dynamic programming
- cutting plane
- np complete
- shortest path problem
- worst case
- np hard
- special case
- evolutionary algorithm