A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems.
Ken KobayashiYuichi TakanoPublished in: Comput. Optim. Appl. (2020)
Keyphrases
- mixed integer
- optimization problems
- cost function
- computational complexity
- objective function
- optimal solution
- simulated annealing
- semidefinite programming
- knapsack problem
- convex hull
- learning algorithm
- np hard
- continuous variables
- evolutionary algorithm
- worst case
- higher dimensional
- search space
- linear programming problems