An Easy Way to Build Parallel State-of-the-art Combinatorial Optimization Problem Solvers: A Computational Study on Solving Steiner Tree Problems and Mixed Integer Semidefinite Programs by using ug[SCIP-*, *]-Libraries.
Yuji ShinanoDaniel RehfeldtTristan GallyPublished in: IPDPS Workshops (2019)
Keyphrases
- combinatorial optimization
- mixed integer
- semidefinite
- optimization problems
- traveling salesman problem
- combinatorial problems
- metaheuristic
- branch and bound
- simulated annealing
- facility location
- cutting plane
- semidefinite programming
- high dimensional
- convex relaxation
- mixed integer programming
- valid inequalities
- exact algorithms
- branch and bound algorithm
- exact solution
- optimal solution
- higher dimensional
- genetic algorithm
- convergence rate
- linear program
- particle swarm optimization
- objective function