The following pages link to Pietro Belotti (Q301397):
Displaying 37 items.
- A primal algorithm for the weighted minimum covering ball problem in \(\mathbb {R}^n\) (Q301399) (← links)
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem (Q323214) (← links)
- Convex hull characterizations of lexicographic orderings (Q330274) (← links)
- OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty (Q374694) (← links)
- Optimizing base station location and configuration in UMTS networks (Q863576) (← links)
- A branch-and-cut method for the obnoxious \(p\)-median problem (Q926563) (← links)
- Optimal oblivious routing under linear and ellipsoidal uncertainty (Q1039914) (← links)
- Fathoming rules for biobjective mixed integer linear programs: review and extensions (Q1751199) (← links)
- A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization (Q1751214) (← links)
- Rounding-based heuristics for nonconvex MINLPS (Q1762458) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- Three ideas for a feasibility pump for nonconvex MINLP (Q2361121) (← links)
- On handling indicator constraints in mixed integer programming (Q2374361) (← links)
- New formulations for the Kissing Number Problem (Q2383541) (← links)
- Multicommodity network design with survivability constraints: some models and algorithms. (Abstract of thesis) (Q2386688) (← links)
- Bound reduction using pairs of linear inequalities (Q2392123) (← links)
- Multi-layer MPLS network design: The impact of statistical multiplexing (Q2426874) (← links)
- On families of quadratic surfaces having fixed intersections with two hyperplanes (Q2444574) (← links)
- Valid inequalities and convex hulls for multilinear functions (Q2861492) (← links)
- Disjunctive Cuts for Nonconvex MINLP (Q2897296) (← links)
- Linear Programming Relaxations of Quadratically Constrained Quadratic Programs (Q2897305) (← links)
- A Probing Algorithm for MINLP with Failure Prediction by SVM (Q3003284) (← links)
- Feasibility-Based Bounds Tightening via Fixed Points (Q3066145) (← links)
- A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem (Q3091526) (← links)
- Branching and bounds tighteningtechniques for non-convex MINLP (Q3396388) (← links)
- Branch-and-Cut Techniques for Solving Realistic Two-Layer Network Design Problems (Q3404461) (← links)
- Multicommodity network design with discrete node costs (Q3418125) (← links)
- Provisioning virtual private networks under traffic uncertainty (Q3418126) (← links)
- Virtual Private Network Design Under Traffic Uncertainty (Q3439121) (← links)
- Network design with grooming constraints (Q3439127) (← links)
- A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization (Q3462302) (← links)
- Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem (Q3596360) (← links)
- Models for production planning under power interruptions (Q4629184) (← links)
- Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming (Q5131728) (← links)
- On the Composition of Convex Envelopes for Quadrilinear Terms (Q5244679) (← links)
- Mixed-integer nonlinear optimization (Q5419635) (← links)
- Efficient storage of Pareto points in biobjective mixed integer programming (Q6256691) (← links)
