Pietro Belotti

发表

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

Leo Liberti, Nora Touati Moungla, Pietro Belotti, 2011, INOC.

Network design with grooming constraints

Federico Malucelli, Pietro Belotti, 2004, Electron. Notes Discret. Math..

Branching and bounds tighteningtechniques for non-convex MINLP

Leo Liberti, Pietro Belotti, François Margot, 2009, Optim. Methods Softw..

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

Pietro Belotti, Tamás Terlaky, Julio C. Góez, 2015, Discret. Optim..

Convex hull characterizations of lexicographic orderings

Pietro Belotti, Ruobing Shen, Warren Adams, 2016, J. Glob. Optim..

Efficient storage of Pareto points in biobjective mixed integer programming pdf

Pietro Belotti, Nathan Adelgren, Akshay Gupte, 2014, INFORMS J. Comput..

Bound reduction using pairs of linear inequalities

Pietro Belotti, P. Belotti, 2013, J. Glob. Optim..

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

Antonio Capone, Federico Malucelli, Pietro Belotti, 2008, Comput. Networks.

A Probing Algorithm for MINLP with Failure Prediction by SVM

Pietro Belotti, Giacomo Nannicini, Jeff T. Linderoth, 2011, CPAIOR.

New formulations for the Kissing Number Problem

Leo Liberti, Pietro Belotti, Nelson Maculan, 2007, Discret. Appl. Math..

QPLIB: a library of quadratic programming instances

Andrea Lodi, Nikolaos V. Sahinidis, Leo Liberti, 2018, Mathematical Programming Computation.

Virtual Private Network Design Under Traffic Uncertainty

Edoardo Amaldi, Pietro Belotti, Mustafa Ç. Pinar, 2004, Electron. Notes Discret. Math..

On handling indicator constraints in mixed integer programming

Matteo Fischetti, Andrea Lodi, Michele Monaci, 2016, Comput. Optim. Appl..

Valid Inequalities and Convex Hulls for Multilinear Functions

Pietro Belotti, Andrew J. Miller, Mahdi Namazifar, 2010, Electron. Notes Discret. Math..

Provisioning virtual private networks under traffic uncertainty

Edoardo Amaldi, Pietro Belotti, Mustafa Ç. Pinar, 2007, Networks.

On the Convergence of Feasibility based Bounds Tightening

Sonia Cafieri, Leo Liberti, Pietro Belotti, 2010, CTW.

Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem

Edoardo Amaldi, Pietro Belotti, Raphael Hauser, 2005, IPCO.

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

Arie M. C. A. Koster, Pietro Belotti, Sebastian Orlowski, 2010, Graphs and Algorithms in Communication Networks.

Multicommodity network design with discrete node costs

Federico Malucelli, Pietro Belotti, Lorenzo Brunetta, 2007, Networks.

Lower bounding procedure for the asymmetric quadratic traveling salesman problem

Borzou Rostami, Federico Malucelli, Pietro Belotti, 2016, Eur. J. Oper. Res..

Algorithms for discrete nonlinear optimization in FICO Xpress

Timo Berthold, Pietro Belotti, Kelligton Neves, 2016, 2016 IEEE Sensor Array and Multichannel Signal Processing Workshop (SAM).

On families of quadratic surfaces having fixed intersections with two hyperplanes

Pietro Belotti, Tamás Terlaky, Julio C. Góez, 2013, Discret. Appl. Math..

Rounding-based heuristics for nonconvex MINLPs

Pietro Belotti, Giacomo Nannicini, P. Belotti, 2011, Mathematical Programming Computation.

Optimization of Catheter Position and Dwell Time in Prostate HDR Brachytherapy using HIPO and Linear Programming

Pietro Belotti, Dimos Baltas, A. Karabis, 2009 .

A branch-and-cut method for the obnoxious p-median problem

Francesco Maffioli, Martine Labbé, Pietro Belotti, 2007, 4OR.

Optimizing base station location and configuration in UMTS networks

Edoardo Amaldi, Antonio Capone, Federico Malucelli, 2006, Ann. Oper. Res..

Feasibility-Based Bounds Tightening via Fixed Points

Sonia Cafieri, Leo Liberti, Pietro Belotti, 2010, COCOA.

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

Borzou Rostami, Federico Malucelli, Pietro Belotti, 2013, 2013 Federated Conference on Computer Science and Information Systems.

Multicommodity network design with survivability constraints: Some models and algorithms

Pietro Belotti, 2005, 4OR.

Three ideas for a feasibility pump for nonconvex MINLP

Timo Berthold, Pietro Belotti, P. Belotti, 2016, Optimization Letters.

Linear Programming Relaxations of Quadratically Constrained Quadratic Programs pdf

Pietro Belotti, François Margot, Andrea Qualizza, 2012, ArXiv.

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

Pietro Belotti, Margaret M. Wiecek, Banu Soylu, 2016 .

On the composition of convex envelopes for quadrilinear terms

Sonia Cafieri, Leo Liberti, Pietro Belotti, 2013 .

OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty

Pietro Belotti, Mustafa Ç. Pınar, P. Belotti, 2010 .

A cut-and-branch-and-price approach to two-layer network design

Pietro Belotti, .

Linear Inequalities for Bounded Products of Variables

Pietro Belotti, P. Belotti, Andrew J. Miller, 2011 .

Disjunctive Inequalities: Applications And Extensions

Andrea Lodi, Leo Liberti, Pietro Belotti, 2011 .

Optimal oblivious routing under statistical uncertainty

Pietro Belotti, Mustafa Ç. Pınar, P. Belotti, 2005 .

Shared Protection network design: valid inequalities and a decomposition approach

Federico Malucelli, Pietro Belotti, P. Belotti, 2022 .

Multicommodity network design with discrete node costs

Federico Malucelli, L. Brunetta, Pietro Belotti, 2007 .