• Publications
  • Influence
Strong SOCP Relaxations for the Optimal Power Flow Problem
TLDR
This paper proposes three strong second order cone programming (SOCP) relaxations for the AC optimal power flow (OPF) problem. Expand
  • 163
  • 20
  • PDF
Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
TLDR
We analyze the lifting of minimal inequalities derived from lattice-free triangles derived using maximal lattICE-free convex sets. Expand
  • 61
  • 11
  • PDF
Two row mixed-integer cuts via lifting
TLDR
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
  • 91
  • 9
  • PDF
Inexactness of SDP Relaxation and Valid Inequalities for Optimal Power Flow
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 includingExpand
  • 110
  • 8
  • PDF
Mixed-integer quadratic programming is in NP
TLDR
The decision version of mixed-integer quadratic programming is in NP, thereby showing that it is NP-complete. Expand
  • 63
  • 8
  • PDF
Constrained Infinite Group Relaxations of MIPs
TLDR
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
  • 78
  • 7
  • PDF
Analysis of MILP Techniques for the Pooling Problem
TLDR
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
  • 34
  • 7
  • PDF
Covering Linear Programming with Violations
TLDR
We consider a class of linear programs involving a set of covering constraints of which at most k are allowed to be violated. Expand
  • 47
  • 6
  • PDF
Solving Mixed Integer Bilinear Problems Using MILP Formulations
TLDR
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
  • 111
  • 5
  • PDF
Improving the Integer L-Shaped Method
TLDR
We consider the integer L-shaped method for two-stage stochastic integer programs of the form (IP) min x,z,θ cx + dz + θ s. Expand
  • 46
  • 5
  • PDF
...
1
2
3
4
5
...