A solution algorithm for non-convex mixed integer optimization problems with only few continuous variables.
Anita SchöbelDaniel ScholzPublished in: Eur. J. Oper. Res. (2014)
Keyphrases
- mixed integer
- continuous variables
- convex hull
- optimal solution
- mixed integer programming
- optimization problems
- discrete variables
- cost function
- objective function
- mixed integer program
- linear program
- integer variables
- binary variables
- learning algorithm
- mathematical model
- feasible solution
- dynamic programming
- network design problem
- knapsack problem
- dynamic systems
- probabilistic model
- k means
- bayesian networks
- shortest path
- particle swarm optimization
- lot sizing
- linear programming
- evolutionary algorithm