16 citations · 22 across the 5 of their papers we have counts for
5 papers
Solving Sparse Mixed-Integer Quadratic Problems: Application to the Unit Commitment Problem with Optimal Power Flow
Ignacio Gómez-Casares, Pietro Belotti, Bissan Ghaddar +1
Mixed-Integer Quadratically Constrained Quadratic Programs (MIQCQP) arise in a variety of applications, particularly in energy, water, and gas systems, where discrete decisions int…
Convex envelopes of bounded monomials on two-variable cones
Pietro Belotti
We consider an -variate monomial function that is restricted both in value by lower and upper bounds and in domain by two homogeneous linear inequalities. Such functions are bui…
Efficient storage of Pareto points in biobjective mixed integer programming
Nathan Adelgren, Pietro Belotti, Akshay Gupte
In biobjective mixed integer linear programs (BOMILPs), two linear objectives are minimized over a polyhedron while restricting some of the variables to be integer. Since many of t…
Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
Andrea Qualizza, Pietro Belotti, Francois Margot
We investigate the use of linear programming tools for solving semidefinite programming relaxations of quadratically constrained quadratic problems. Classes of valid linear inequal…
A local branching heuristic for MINLPs
Giacomo Nannicini, Pietro Belotti, Leo Liberti
Local branching is an improvement heuristic, developed within the context of branch-and-bound algorithms for MILPs, which has proved to be very effective in practice. For the binar…