Pietro Belotti

According to our database1, Pietro Belotti authored at least 31 papers between 2004 and 2019.

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


QPLIB: a library of quadratic programming instances.
Math. Program. Comput., 2019

Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming.
INFORMS J. Comput., 2018

Three ideas for a feasibility pump for nonconvex MINLP.
Optim. Lett., 2017

A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization.
Discret. Optim., 2017

Convex hull characterizations of lexicographic orderings.
J. Glob. Optim., 2016

Lower bounding procedure for the asymmetric quadratic traveling salesman problem.
Eur. J. Oper. Res., 2016

On handling indicator constraints in mixed integer programming.
Comput. Optim. Appl., 2016

Algorithms for discrete nonlinear optimization in FICO Xpress.
Proceedings of the 2016 IEEE Sensor Array and Multichannel Signal Processing Workshop (SAM), 2016

Bound reduction using pairs of linear inequalities.
J. Glob. Optim., 2013

On families of quadratic surfaces having fixed intersections with two hyperplanes.
Discret. Appl. Math., 2013

Mixed-integer nonlinear optimization.
Acta Numer., 2013

Quadratic TSP: A lower bounding procedure and a column generation approach.
Proceedings of the 2013 Federated Conference on Computer Science and Information Systems, 2013

Rounding-based heuristics for nonconvex MINLPs.
Math. Program. Comput., 2012

Linear Programming Relaxations of Quadratically Constrained Quadratic Programs
CoRR, 2012

A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem.
Proceedings of the Network Optimization - 5th International Conference, 2011

A Probing Algorithm for MINLP with Failure Prediction by SVM.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2011

Valid Inequalities and Convex Hulls for Multilinear Functions.
Electron. Notes Discret. Math., 2010

On the Convergence of Feasibility based Bounds Tightening.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

Feasibility-Based Bounds Tightening via Fixed Points.
Proceedings of the Combinatorial Optimization and Applications, 2010

Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems.
Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

Branching and bounds tighteningtechniques for non-convex MINLP.
Optim. Methods Softw., 2009

Multi-layer MPLS network design: The impact of statistical multiplexing.
Comput. Networks, 2008

Multicommodity network design with discrete node costs.
Networks, 2007

Provisioning virtual private networks under traffic uncertainty.
Networks, 2007

New formulations for the Kissing Number Problem.
Discret. Appl. Math., 2007

A branch-and-cut method for the obnoxious <i>p</i> -median problem.
4OR, 2007

Optimizing base station location and configuration in UMTS networks.
Ann. Oper. Res., 2006

Multicommodity network design with survivability constraints: Some models and algorithms.
4OR, 2005

Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2005

Network design with grooming constraints.
Electron. Notes Discret. Math., 2004

Virtual Private Network Design Under Traffic Uncertainty.
Electron. Notes Discret. Math., 2004