LaGO: a (heuristic) Branch and Cut algorithm for nonconvex MINLPs.
Ivo NowakStefan VigerskePublished in: Central Eur. J. Oper. Res. (2008)
Keyphrases
- optimal solution
- times faster
- objective function
- dynamic programming
- experimental evaluation
- learning algorithm
- matching algorithm
- search space
- packing problem
- k means
- similarity measure
- recognition algorithm
- detection algorithm
- optimization algorithm
- segmentation algorithm
- optimization problems
- simulated annealing
- computational cost
- computational complexity
- preprocessing
- bin packing
- significant improvement
- heuristic rules
- exhaustive search
- extremal optimization
- quadratic optimization problems
- solution quality
- knapsack problem
- expectation maximization
- particle swarm optimization
- probabilistic model
- np hard
- cost function
- clustering algorithm