Hacene Ouzia

Learn More
In this paperwe introduceDRL*, a newhierarchy of linear relaxations for 0–1mixed integer linear programs (MIPs), based on the idea of Reformulation–Linearization, and explore its links with the Lift-and-Project (L&P) hierarchy and the Sherali–Adams (RLT) hierarchy. The relaxations of the new hierarchy are shown to be intermediate in strength between L&P and(More)
In this work we focus on solving quadratically constrained pseudoboolean optimization problems with quadratic objective as mixed integer linear programs. The standard mixed integer linear formulation of such problems is strengthened using valid inequalities derived from solving Reformulation-Linearization relaxation called partial DRL* relaxation. The(More)
  • 1