On coordinated cutting plane generation and mixed integer programs with nonconvex 2-norm constraints.
Stefano ConiglioPublished in: 4OR (2013)
Keyphrases
- cutting plane
- mixed integer program
- mixed integer
- cutting plane algorithm
- valid inequalities
- integer programming
- column generation
- objective function
- integer program
- lower bound
- knapsack problem
- feasible solution
- linear program
- convex functions
- optimal solution
- optimization problems
- linear programming
- convex hull
- continuous variables
- cost function
- linear constraints
- genetic algorithm
- search space
- evolutionary algorithm
- mixed integer programming
- lagrangian relaxation
- np hard
- piecewise linear
- lot sizing
- greedy algorithm
- metaheuristic