On a nonseparable convex maximization problem with continuous knapsack constraints.
H. Edwin RomeijnJoseph GeunesKevin M. TaaffePublished in: Oper. Res. Lett. (2007)
Keyphrases
- piecewise linear
- dynamic programming
- inequality constraints
- objective function
- knapsack problem
- wavelet transform
- convex constraints
- convex hull
- neural network
- constrained optimization
- continuous variables
- global constraints
- cover inequalities
- auxiliary variables
- feasible set
- discrete space
- optimal solution
- feasible solution
- filter bank
- optimization problems
- upper bound
- mixed integer
- convex sets
- feature vectors
- constraint satisfaction
- constrained minimization
- np hard