Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality.
Bezalel GavishHasan PirkulPublished in: Math. Program. (1985)
Keyphrases
- knapsack problem
- efficient algorithms for solving
- optimal solution
- lower bound
- least squares
- np hard
- linear programming relaxation
- combinatorial optimization problems
- test problems
- upper bound
- optimization problems
- branch and bound algorithm
- branch and bound
- canonical correlation analysis
- production planning
- dynamic programming
- exact algorithms
- objective function
- implicit enumeration
- metaheuristic
- feasible solution
- cutting plane
- greedy algorithm
- linear program
- worst case
- special case
- column generation
- nsga ii
- solution quality
- maximum profit
- lower and upper bounds
- neural network
- linear programming