Continuous maximin knapsack problems with GLB constraints.
Horst A. EiseltPublished in: Math. Program. (1986)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- lower bound
- optimization problems
- test problems
- optimal solution
- linear programming relaxation
- exact algorithms
- dynamic programming
- np hard problems
- binary variables
- production planning
- upper bound
- bicriteria
- greedy algorithm
- linear constraints
- graph theory
- continuous relaxation
- maximum profit
- lower and upper bounds
- neural network
- constraint programming
- constraint satisfaction
- np hard
- machine learning