On the knapsack closure of 0-1 Integer Linear Programs.
Matteo FischettiAndrea LodiPublished in: Electron. Notes Discret. Math. (2010)
Keyphrases
- linear program
- dynamic programming
- optimal solution
- extreme points
- linear programming
- knapsack problem
- feasible solution
- semi infinite
- simplex method
- column generation
- np hard
- multistage stochastic
- stochastic programming
- integer solution
- primal dual
- interior point methods
- continuous relaxation
- linear programming problems
- objective function
- linear inequalities
- mixed integer linear program
- mixed integer
- decision variables
- packing problem
- upper bound
- integer program
- nelder mead
- strongly polynomial
- market equilibrium
- machine learning
- geometric properties
- metaheuristic
- learning algorithm