Pietro Belotti

According to our database, Pietro Belotti authored at least 33 papers between 2001 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2019

QPLIB: a library of quadratic programming instances.

Fabio Furini, Emiliano Traversi, Pietro Belotti, Antonio Frangioni, Ambros M. Gleixner, Nick Gould, Leo Liberti, Andrea Lodi, Ruth Misener, Hans D. Mittelmann, Nikolaos V. Sahinidis, Stefan Vigerske, Angelika Wiegele

Math. Program. Comput., 2019

2018

Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming.

Nathan Adelgren, Pietro Belotti, Akshay Gupte

INFORMS J. Comput., 2018

2017

Three ideas for a feasibility pump for nonconvex MINLP.

Pietro Belotti, Timo Berthold

Optim. Lett., 2017

A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization.

Pietro Belotti, Julio Cesar Goez, Imre Pólik, Ted K. Ralphs, Tamás Terlaky

Discret. Optim., 2017

2016

Convex hull characterizations of lexicographic orderings.

Warren Adams, Pietro Belotti, Ruobing Shen

J. Glob. Optim., 2016

Lower bounding procedure for the asymmetric quadratic traveling salesman problem.

Borzou Rostami, Federico Malucelli, Pietro Belotti, Stefano Gualandi

Eur. J. Oper. Res., 2016

Fathoming rules for biobjective mixed integer linear programs: Review and extensions.

Pietro Belotti, Banu Soylu, Margaret M. Wiecek

Discret. Optim., 2016

On handling indicator constraints in mixed integer programming.

Pietro Belotti, Pierre Bonami, Matteo Fischetti, Andrea Lodi, Michele Monaci, Amaya Nogales-Gómez, Domenico Salvagnin

Comput. Optim. Appl., 2016

Algorithms for discrete nonlinear optimization in FICO Xpress.

Pietro Belotti, Timo Berthold, Kelligton Neves

Proceedings of the 2016 IEEE Sensor Array and Multichannel Signal Processing Workshop (SAM), 2016

2013

Bound reduction using pairs of linear inequalities.

Pietro Belotti

J. Glob. Optim., 2013

On families of quadratic surfaces having fixed intersections with two hyperplanes.

Pietro Belotti, Julio Cesar Goez, Imre Pólik, Ted K. Ralphs, Tamás Terlaky

Discret. Appl. Math., 2013

Mixed-integer nonlinear optimization.

Pietro Belotti, Christian Kirches, Sven Leyffer, Jeff T. Linderoth, James R. Luedtke, Ashutosh Mahajan

Acta Numer., 2013

Quadratic TSP: A lower bounding procedure and a column generation approach.

Borzou Rostami, Federico Malucelli, Pietro Belotti, Stefano Gualandi

Proceedings of the 2013 Federated Conference on Computer Science and Information Systems, 2013

2012

Rounding-based heuristics for nonconvex MINLPs.

Giacomo Nannicini, Pietro Belotti

Math. Program. Comput., 2012

Linear Programming Relaxations of Quadratically Constrained Quadratic Programs

Andrea Qualizza, Pietro Belotti, François Margot

CoRR, 2012

2011

A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem.

Nora Touati Moungla, Pietro Belotti, Vincent Jost, Leo Liberti

Proceedings of the Network Optimization - 5th International Conference, 2011

A Probing Algorithm for MINLP with Failure Prediction by SVM.

Giacomo Nannicini, Pietro Belotti, Jon Lee, Jeff T. Linderoth, François Margot, Andreas Wächter

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2011

2010

Valid Inequalities and Convex Hulls for Multilinear Functions.

Pietro Belotti, Andrew J. Miller, Mahdi Namazifar

Electron. Notes Discret. Math., 2010

On the Convergence of Feasibility based Bounds Tightening.

Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti

Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

Feasibility-Based Bounds Tightening via Fixed Points.

Pietro Belotti, Sonia Cafieri, Jon Lee, Leo Liberti

Proceedings of the Combinatorial Optimization and Applications, 2010

Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems.

Sebastian Orlowski, Christian Raack, Arie M. C. A. Koster, Georg Baier, Thomas Engel, Pietro Belotti

Proceedings of the Graphs and Algorithms in Communication Networks: Studies in Broadband, 2010

2009

Branching and bounds tighteningtechniques for non-convex MINLP.

Pietro Belotti, Jon Lee, Leo Liberti, François Margot, Andreas Wächter

Optim. Methods Softw., 2009

2008

Multi-layer MPLS network design: The impact of statistical multiplexing.

Pietro Belotti, Antonio Capone, Giuliana Carello, Federico Malucelli

Comput. Networks, 2008

2007

Multicommodity network design with discrete node costs.

Pietro Belotti, Federico Malucelli, Lorenzo Brunetta

Networks, 2007

Provisioning virtual private networks under traffic uncertainty.

Aysegül Altin, Edoardo Amaldi, Pietro Belotti, Mustafa Ç. Pinar

Networks, 2007

New formulations for the Kissing Number Problem.

Sergei S. Kucherenko, Pietro Belotti, Leo Liberti, Nelson Maculan

Discret. Appl. Math., 2007

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

Pietro Belotti, Martine Labbé, Francesco Maffioli, Malick M. Ndiaye

4OR, 2007

2006

Optimizing base station location and configuration in UMTS networks.

Edoardo Amaldi, Pietro Belotti, Antonio Capone, Federico Malucelli

Ann. Oper. Res., 2006

2005

Multicommodity network design with survivability constraints: Some models and algorithms.

Pietro Belotti

4OR, 2005

Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem.

Edoardo Amaldi, Pietro Belotti, Raphael Hauser

Proceedings of the Integer Programming and Combinatorial Optimization, 2005

2004

Network design with grooming constraints.

Pietro Belotti, Federico Malucelli

Electron. Notes Discret. Math., 2004

Virtual Private Network Design Under Traffic Uncertainty.

Aysegül Altin, Edoardo Amaldi, Pietro Belotti, Mustafa Ç. Pinar

Electron. Notes Discret. Math., 2004

2001

Optimal Placement of Wavelength Converting Nodes.

Pietro Belotti, Thomas Stidsen

Proceedings of the 3rd International Workshop on the Design of Reliable Communication Networks, 2001