A Lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures.
Ramkumar KaruppiahIgnacio E. GrossmannPublished in: J. Glob. Optim. (2008)
Keyphrases
- global optimization
- mixed integer
- global solution
- optimal solution
- particle swarm optimization
- global search
- cost function
- optimization algorithm
- objective function
- learning algorithm
- expectation maximization
- dynamic programming
- convex hull
- simulated annealing
- k means
- constrained global optimization
- network design problem
- np hard
- lot sizing
- computational complexity
- knapsack problem
- imperialist competitive algorithm
- mixed integer programming
- routing problem
- mathematical model
- parameter estimation
- probabilistic model
- linear programming