Solving Convex MINLP Optimization Problems Using a Sequential Cutting Plane Algorithm.
Claus StillTapio WesterlundPublished in: Comput. Optim. Appl. (2006)
Keyphrases
- cutting plane algorithm
- quadratic program
- nonlinear programming
- optimization problems
- maximum margin
- mixed integer
- cutting plane
- valid inequalities
- convex hull
- linear programming problems
- evolutionary algorithm
- linear programming
- knapsack problem
- linear program
- metaheuristic
- combinatorial optimization
- convex optimization
- optimality conditions
- objective function
- continuous relaxation
- integer programming
- semidefinite programming
- support vector
- linear constraints
- pattern classification
- learning algorithm
- cost function
- mixed integer programming
- column generation
- traveling salesman problem
- hyperplane
- convex sets
- lot sizing
- quadratic programming
- maximum likelihood
- markov networks
- integer program
- support vector machine
- convex programming
- optimal solution