This text presents research results of the Belgian Program on Interuniversity Poles of Attraction initiated by the Belgian State, Prime Minister’s Office, Science Policy Programming.Expand

It has been recently proven that the semidefinite programming (SDP) relaxation of the optimal power flow problem over radial networks is exact under technical conditions such as not including… Expand

We consider a stronger relaxation of general mixed integer sets by allowing constraints, such as bounds, on the free integer variables in the continuous group relaxation.Expand

We prove that the ratio of the upper bound obtained by solving piecewise-linear relaxations (objective function is maximization) to optimal objective function value of the pooling problem is at most n, where n is the number of output nodes.Expand

In this paper, we examine a mixed integer linear programming reformulation for mixed integer bilinear problems where each bil inearterm involves the product of a non negative integer variable and a nonnegative continuous variable.Expand