A branch & bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints.
George KozanidisEmanuel MelachrinoudisPublished in: Comput. Oper. Res. (2004)
Keyphrases
- knapsack problem
- mixed integer
- optimal solution
- branch bound
- continuous relaxation
- integer variables
- dynamic programming
- multidimensional knapsack problem
- np hard
- continuous variables
- linear programming problems
- cutting plane
- learning algorithm
- particle swarm optimization
- optimization problems
- worst case
- objective function
- computational complexity
- cost function
- linear program
- convex hull
- greedy algorithm
- lower bound
- lp relaxation
- mixed integer programming
- exact algorithms
- multiple choice
- neural network
- search space
- valid inequalities
- evolutionary algorithm
- lower and upper bounds
- probabilistic model
- scheduling problem
- graph cuts
- expectation maximization
- linear programming