no code implementations • 29 Aug 2022 • Mikhail Krechetov
In computer science, it is called the Maximum Cut problem, one of the famous twenty-one Karp's original NP-hard problems, while the same object from Physics is called the Ising Spin Glass model.
1 code implementation • 5 Aug 2017 • Roman Pogodin, Mikhail Krechetov, Yury Maximov
We propose a method for low-rank semidefinite programming in application to the semidefinite relaxation of unconstrained binary quadratic problems.
Optimization and Control
