Cooperative strategies for solving the bicriteria sparse multiple knapsack problem.
F. Sibel SalmanJayant KalagnanamSesh MurthyPublished in: CEC (1999)
Keyphrases
- bicriteria
- knapsack problem
- cooperative
- randomly generated test instances
- combinatorial optimization problems
- implicit enumeration
- optimal solution
- exact algorithms
- efficient solutions
- dynamic programming
- optimization problems
- np hard
- multidimensional knapsack problem
- greedy algorithm
- lp relaxation
- integer linear programming
- integer variables
- shortest path problem
- flowshop
- combinatorial optimization
- upper bound
- evolutionary algorithm
- lower bound
- neural network