Pietro Belotti

From MaRDI portal
Revision as of 12:23, 6 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:301397

Available identifiers

zbMath Open belotti.pietroMaRDI QIDQ301397

List of research outcomes

PublicationDate of PublicationType
Convex envelopes of bounded monomials on two-variable cones2023-08-24Paper
Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming2020-11-09Paper
QPLIB: a library of quadratic programming instances2019-12-19Paper
Models for production planning under power interruptions2019-03-26Paper
Fathoming rules for biobjective mixed integer linear programs: review and extensions2018-05-24Paper
A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization2018-05-24Paper
Three ideas for a feasibility pump for nonconvex MINLP2017-06-29Paper
On handling indicator constraints in mixed integer programming2016-12-15Paper
Convex hull characterizations of lexicographic orderings2016-10-25Paper
Lower bounding procedure for the asymmetric quadratic traveling salesman problem2016-10-07Paper
A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\)2016-06-30Paper
A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization2016-01-05Paper
On the Composition of Convex Envelopes for Quadrilinear Terms2015-03-30Paper
Efficient storage of Pareto points in biobjective mixed integer programming2014-11-24Paper
Mixed-integer nonlinear optimization2014-06-11Paper
On families of quadratic surfaces having fixed intersections with two hyperplanes2014-04-10Paper
https://portal.mardi4nfdi.de/entity/Q28614922013-11-08Paper
OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty2013-10-24Paper
Bound reduction using pairs of linear inequalities2013-08-01Paper
Rounding-based heuristics for nonconvex MINLPS2012-11-27Paper
Disjunctive Cuts for Nonconvex MINLP2012-07-10Paper
Linear Programming Relaxations of Quadratically Constrained Quadratic Programs2012-07-10Paper
A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem2011-09-09Paper
A Probing Algorithm for MINLP with Failure Prediction by SVM2011-05-26Paper
Feasibility-Based Bounds Tightening via Fixed Points2011-01-08Paper
Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems2010-02-09Paper
Optimal oblivious routing under linear and ellipsoidal uncertainty2009-11-23Paper
Branching and bounds tighteningtechniques for non-convex MINLP2009-09-18Paper
A local branching heuristic for MINLPs2008-12-11Paper
A branch-and-cut method for the obnoxious \(p\)-median problem2008-05-20Paper
Multi-layer MPLS network design: The impact of statistical multiplexing2008-05-14Paper
New formulations for the Kissing Number Problem2007-09-19Paper
Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem2007-08-30Paper
Virtual Private Network Design Under Traffic Uncertainty2007-05-29Paper
Network design with grooming constraints2007-05-29Paper
Optimizing base station location and configuration in UMTS networks2007-02-05Paper
Multicommodity network design with discrete node costs2007-02-02Paper
Provisioning virtual private networks under traffic uncertainty2007-02-02Paper
Multicommodity network design with survivability constraints: some models and algorithms. (Abstract of thesis)2005-08-25Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Pietro Belotti