Lifting two-integer knapsack inequalities.
Agostinho AgraMiguel Fragoso ConstantinoPublished in: Math. Program. (2007)
Keyphrases
- knapsack problem
- integer variables
- integer solution
- facet defining
- feasible solution
- linear programming relaxation
- facet defining inequalities
- mixed integer linear programs
- dynamic programming
- wavelet transform
- packing problem
- cover inequalities
- sufficient conditions
- optimal solution
- upper bound
- branch and bound algorithm
- valid inequalities
- neural network
- objective function
- mixed integer
- lifting scheme
- data sets
- image coding
- evolutionary algorithm
- integer valued
- multiresolution
- multiple choice
- floating point
- mathematical model
- greedy algorithm