See my Google Scholar page

  1. F. Furini et al., “QPLIB: A library of quadratic programming instances”, Mathematical Programming Computation 11(2):237-265 (2019).
  2. N. Adelgren, P. Belotti, A. Gupte, “Efficient storage of Pareto points in biobjective mixed integer programming”, Informs Journal on Computing 30(2): 324-338 (2018).
  3. P. Belotti, J.C. Góez, I. Pólik, T.K. Ralphs, T. Terlaky, “A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization”, Discrete Optimization 24:3-31 (2017).
  4. P. Belotti, T. Berthold, “Three ideas for a feasibility pump for nonconvex MINLP”, Optimization Letters 11(1):3-15 (2017).
  5. P. Belotti, P. Bonami, M. Fischetti, A. Lodi, M. Monaci, A. Nogales-Gómez, “On handling indicator constraints in mixed integer programming”, Computational Optimization and Applications 65(3):545-566 (2016).
  6. P. Belotti, B. Soylu, M.M. Wiecek, “Fathoming rules for biobjective mixed integer linear programs: Review and extensions”, Discrete Optimization 22:341-363 (2016).
  7. W. Adams, P. Belotti, R. Shen, “Convex hull characterizations of lexicographic orderings”, Journal of Global Optimization 66(2):311-329 (2016).
  8. B. Rostami, F. Malucelli, P. Belotti, S. Gualandi, “Lower bounding procedure for the asymmetric quadratic traveling salesman problem”, European Journal of Operational Research 253(3):584-592 (2016).
  9. P.M. Dearing, P. Belotti, A.M. Smith, “A primal algorithm for the weighted minimum covering ball problem in”, TOP 24(2):466-492 (2016).
  10. T.J. Mullin, P. Belotti, “Using branch-and-bound algorithms to optimize selection of a fixed-size breeding population under a relatedness constraint”, Tree Genetics & Genomes 12(1):4 (2016).
  11. P. Belotti, J.C. Góez, I. Pólik, T.K. Ralphs, T. Terlaky, “A conic representation of the convex hull of disjunctive sets and conic cuts for integer second order cone optimization”, Numerical Analysis and Optimization, 1-35 (2015).
  12. P. Belotti, Z. Csizmadia, S. Heipcke, S. Lannez, “Robust Optimization with FICO TM Xpress”, White paper, Fair Isaac Corp. (2014).
  13. P. Belotti, J.C. Góez, I. Pólik, T.K. Ralphs, T. Terlaky, “On families of quadratic surfaces having fixed intersections with two hyperplanes”, Discrete Applied Mathematics, 161(16):2778-2793 (2013).
  14. Ç. Latifoğlu, P. Belotti, L.V. Snyder, “Models for production planning under power interruptions”, Naval Research Logistics, 60(5):413-431 (2013).
  15. P. Belotti, C. Kirches, S. Leyffer, J. Linderoth, J. Luedtke, and A. Mahajan, “Mixed-Integer Nonlinear Optimization”, Acta Numerica 22:1-131 (2013).
  16. G. Nannicini and P. Belotti, “Rounding-based heuristics for nonconvex MINLPs”, Mathematical Programming Computation 4(1):1-31 (2012).
  17. P. Belotti, “Bound reduction using pairs of linear inequalities”, Journal of Global Optimization 56(3):787-819 (2012).
  18. P. Belotti, A.J. Miller, M. Namazifar, “Linear inequalities for bounded products of variables”, SIAG/OPT Views-and-News 22(1):1-7 (2011).
  19. A. Altın, P. Belotti, M.Ç. Pınar, “OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty,” Optimization and Engineering 11(3):395-422 (2010).
  20. P. Belotti, J. Lee, L. Liberti, F. Margot, A. Wächter, “Branching and bounds tightening techniques for non-convex MINLP,” Optimization Methods and Software 24(4-5):597-634 (2009).
  21. P. Belotti, M.Ç. Pınar, “Optimal oblivious routing under linear and ellipsoidal uncertainty,” Optimization and Engineering 9(3):257-271 (2008).
  22. P. Belotti, A. Capone, G. Carello, F. Malucelli, “Multi-layer MPLS network design: the impact of statistical multiplexing,” Computer Networks 52(6):1291-1307 (2008).
  23. P. Belotti, M. Labbé, F. Maffioli, M. M. Ndiaye, “A branch-and-cut method for the obnoxious p-median problem,” 4OR 5(4):299-314 (2007).
  24. S. Kucherenko, P. Belotti, L. Liberti, N. Maculan, “New formulations for the kissing number problem,” Discrete Applied Mathematics 155(14):1837-1841 (2007).
  25. A. Altın, E. Amaldi, P. Belotti, M.Ç. Pınar, “Provisioning virtual private networks under traffic uncertainty,” Networks 49(1):100-115 (2007).
  26. P. Belotti, F. Malucelli, L. Brunetta, “Multicommodity network design with discrete node costs,” Networks 49(1):90-99 (2007).
  27. E. Amaldi, P. Belotti, A. Capone, F. Malucelli, “Optimizing base station location and configuration in UMTS networks,” Annals of Operations Research 146(1):135-151 (2006).
  28. P. Belotti, “Multicommodity network design with survivability constraints: Some models and algorithms,” 4OR 3(1):79-81 (2005).
  29. P. Belotti, “Disjunctive cuts for non-convex MINLP”. J. Lee and S. Leyffer (eds.), Mixed Integer Nonlinear Programming, IMA Volumes in Mathematics and its Applications, vol. 154, Springer, 117-144 (2012).
  30. A. Qualizza, P. Belotti, F. Margot, “Linear programming relaxations of quadratically constrained quadratic programs”. J. Lee and S. Leyffer (eds.), Mixed Integer Nonlinear Programming, IMA Volumes in Mathematics and its Applications, vol. 154, Springer, 407-426 (2012).
  31. P. Belotti, L. Liberti, A. Lodi, G. Nannicini, A. Tramontani, “Disjunctive inequalities: applications and extensions.” J. Cochran et al. (eds.), Encyclopedia of Operations Research and Management Science, John Wiley & Sons (2010).
  32. S. Orlowski, C. Raack, A.M.C.A. Koster, G. Baier, T. Engel, P. Belotti, “Branch-and-cut techniques for solving realistic two-layer network design problems,” in A.M.C.A. Koster, X. Muñoz (eds.), Graphs and Algorithms in Communication Networks, Springer-Verlag, 95-117 (2009).
  33. P. Belotti, S. Cafieri, J. Lee, L. Liberti, A. Miller, “On the composition of convex envelopes for quadrilinear terms”. In A. Chinchuluun et al. (ed.), Proceedings of International Conference on Optimization, Simulation and Control, series: Springer Optimization and its Application, Springer, 2012.
  34. N. Touati-Moungla, P. Belotti, V. Jost, L. Liberti, “A Branch-and-Price Algorithm for the Risk-Equity Constrained Routing Problem”. In J. Pahl, T. Reiners, S. Voß (eds.), Network Optimization, Lecture Notes in Computer Science 6701, 439-449, Springer Berlin/Heidelberg (2011).
  35. G. Nannicini, P. Belotti, J. Lee, J. Linderoth, F. Margot, A. Wächter, “A Probing Algorithm for MINLP with Failure Prediction by SVM,” Proceedings of the eighth International Conference on Integration of Artificial Intelligence (AI) and Operations Research (OR) techniques in Constraint Programming (CPAIOR 2011), 154-169, Berlin, Germany (June 2011).
  36. P. Belotti, S. Cafieri, J. Lee, L. Liberti, “Feasibility-based bounds tightening via fixed points,” Proceedings of the 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2010), Big Island, Hawaii (December 2010).
  37. A. Karabis, P. Belotti, D. Baltas, “Optimization of catheter position and dwell time in prostate HDR brachytherapy using HIPO and linear programming,” Proceedings of the World Congress on Medical Physics and Biomedical Engineering, 612-615, Munich, Germany (September 2009).
  38. G. Panza, A. Capone, D. Pinarello, P. Belotti, “Robustness in next-generation networks,” Proceedings of the ICT Summit Europe, Santander, Spain (June 2009).
  39. P. Belotti, A. Capone, G. Carello, F. Malucelli, F. Senaldi, A. Totaro, “Design of Multi-layer networks with traffic grooming and statistical multiplexing,” Proceedings of the International Network Optimization Conference (INOC 2007), Spa, Belgium (April 2007).
  40. P. Belotti, A. Capone, G. Carello, F. Malucelli, F. Senaldi, A. Totaro, “MPLS over transport network: two layer approach to network design with statistical multiplexing,” Proceedings of the 2nd Conference on Next Generation Internet Design and Engineering, 333-340, Valencia, Spain (April 2006).
  41. E. Amaldi, P. Belotti, R. Hauser, “Randomized relaxation methods for the maximum feasible subsystem problem,” Proceedings of the 11th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2005), 259-264, Berlin, Germany (June 2005).
  42. P. Belotti, F. Malucelli, “Row-column generation for multilayer network design,” Proceedings of the International Network Optimization Conference (INOC 2005), 422-427, Lisbon, Portugal (March 2005).
  43. P. Belotti, F. Malucelli, “Relaxation approach to network design with shared protection,” Proceedings of the International Network Optimization Conference (INOC 2003), 72-77, Paris-Evry, France (October 2003).
  44. P. Belotti, T. Stidsen, “Optimal placement of wavelength converting nodes,” Proceedings of the Third International Workshop on Design of Reliable Communication Networks (DRCN 2001), 15-21, Budapest, (October 2001).