Mixed-integer semidefinite programs (MISDPs) arise in many applications and several
problem-specific solution approaches have been studied recently. In this paper, we …

We present a unified exact tensor network approach to compute the ground state energy,
identify the optimal configuration, and count the number of solutions for spin glasses. The …

Mathematical modelling of market design issues in liberalized electricity markets often leads
to mixed-integer nonlinear multilevel optimization problems for which no general-purpose …

We consider a cutting-plane algorithm for solving mixed-integer semidefinite optimization
(MISDO) problems. In this algorithm, the positive semidefinite (psd) constraint is relaxed, and …

The graph partition problem (GPP) aims at clustering the vertex set of a graph into a fixed
number of disjoint subsets of given sizes such that the sum of weights of edges joining …

We consider an extended version of the classical Max-k k-Cut problem in which we
additionally require that the parts of the graph partition are connected. For this problem we …

We consider several semidefinite programming relaxations for the max-k-cut problem, with
increasing complexity. The optimal solution of the weakest presented semidefinite …

In this paper, a methodology to solve the optimal reactive power dispatch (ORPD) in electric
power systems (EPS), considering discrete controllers, is proposed. Discrete controllers …

The max-k-cut problem is one of the most well-known combinatorial optimization problems.
In this paper, we design an efficient branch-and-bound algorithm to solve the max-k-cut …

In the k-partition problem (k-PP), one is given an edge-weighted undirected graph, and one
must partition the node set into at most k subsets, in order to minimise (or maximise) the total …