Pietro Belotti

2.3k total citations · 2 hit papers
40 papers, 1.3k citations indexed

About

Pietro Belotti is a scholar working on Numerical Analysis, Computer Networks and Communications and Control and Systems Engineering. According to data from OpenAlex, Pietro Belotti has authored 40 papers receiving a total of 1.3k indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Numerical Analysis, 13 papers in Computer Networks and Communications and 11 papers in Control and Systems Engineering. Recurrent topics in Pietro Belotti's work include Advanced Optimization Algorithms Research (14 papers), Vehicle Routing Optimization Methods (9 papers) and Advanced Optical Network Technologies (9 papers). Pietro Belotti is often cited by papers focused on Advanced Optimization Algorithms Research (14 papers), Vehicle Routing Optimization Methods (9 papers) and Advanced Optical Network Technologies (9 papers). Pietro Belotti collaborates with scholars based in United States, Italy and Türkiye. Pietro Belotti's co-authors include Leo Liberti, Christian Kirches, Ashutosh Mahajan, François Margot, Andreas Wächter, Jeff Linderoth, James Luedtke, Sven Leyffer, Jon Lee and Mustafa Ç. Pı̆nar and has published in prestigious journals such as European Journal of Operational Research, Operations Research and Computer Networks.

In The Last Decade

Pietro Belotti

37 papers receiving 1.2k citations

Hit Papers

Mixed-integer nonlinear o... 2009 2026 2014 2020 2013 2009 100 200 300 400

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Pietro Belotti United States 15 406 362 360 324 213 40 1.3k
Pierre Bonami France 16 534 1.3× 434 1.2× 520 1.4× 241 0.7× 118 0.6× 34 1.5k
Ambros Gleixner Germany 16 384 0.9× 282 0.8× 245 0.7× 188 0.6× 134 0.6× 44 1.0k
Juan Pablo Vielma United States 18 409 1.0× 287 0.8× 342 0.9× 260 0.8× 87 0.4× 44 1.4k
François Margot United States 19 586 1.4× 488 1.3× 456 1.3× 371 1.1× 202 0.9× 44 2.0k
Benoît Colson Belgium 9 483 1.2× 494 1.4× 192 0.5× 181 0.6× 82 0.4× 12 1.5k
Panagiotis Patrinos Belgium 22 940 2.3× 226 0.6× 336 0.9× 219 0.7× 164 0.8× 118 2.0k
Stefan Ruzika Germany 17 281 0.7× 427 1.2× 144 0.4× 93 0.3× 136 0.6× 65 1.0k
Arvind U. Raghunathan United States 22 452 1.1× 258 0.7× 108 0.3× 215 0.7× 393 1.8× 80 1.5k
Marc E. Pfetsch Germany 17 199 0.5× 240 0.7× 127 0.4× 256 0.8× 122 0.6× 74 1.2k
Tobias Achterberg Germany 13 385 0.9× 528 1.5× 355 1.0× 299 0.9× 383 1.8× 25 1.8k

Countries citing papers authored by Pietro Belotti

Since Specialization
Citations

This map shows the geographic impact of Pietro Belotti's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Pietro Belotti with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Pietro Belotti more than expected).

Fields of papers citing papers by Pietro Belotti

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Pietro Belotti. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Pietro Belotti. The network helps show where Pietro Belotti may publish in the future.

Co-authorship network of co-authors of Pietro Belotti

This figure shows the co-authorship network connecting the top 25 collaborators of Pietro Belotti. A scholar is included among the top collaborators of Pietro Belotti based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Pietro Belotti. Pietro Belotti is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Belotti, Pietro, et al.. (2025). Political Districting to Optimize the Polsby-Popper Compactness Score with Application to Voting Rights. Operations Research. 73(5). 2330–2350.
2.
Belotti, Pietro, et al.. (2024). Optimization of E-bike networks. Transportation Planning and Technology. 47(6). 922–943. 1 indexed citations
3.
Brown, Tom, Jonas Hörsch, Fabian Neumann, et al.. (2020). PyPSA/PyPSA: PyPSA Version 0.17.1. Zenodo (CERN European Organization for Nuclear Research). 1 indexed citations
4.
Belotti, Pietro, et al.. (2018). Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming. INFORMS journal on computing. 30(2). 324–338. 2 indexed citations
5.
Belotti, Pietro, et al.. (2016). A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization. Discrete Optimization. 24. 3–31. 4 indexed citations
6.
Belotti, Pietro & Timo Berthold. (2016). Three ideas for a feasibility pump for nonconvex MINLP. Optimization Letters. 11(1). 3–15. 5 indexed citations
7.
Belotti, Pietro, Banu Soylu, & Margaret M. Wiecek. (2016). Fathoming rules for biobjective mixed integer linear programs: Review and extensions. Discrete Optimization. 22. 341–363. 21 indexed citations
8.
Belotti, Pietro, Pierre Bonami, Matteo Fischetti, et al.. (2016). On handling indicator constraints in mixed integer programming. Computational Optimization and Applications. 65(3). 545–566. 64 indexed citations
9.
Malucelli, Federico, et al.. (2016). Lower bounding procedure for the asymmetric quadratic traveling salesman problem. European Journal of Operational Research. 253(3). 584–592. 8 indexed citations
10.
Adams, Warren P., et al.. (2016). Convex hull characterizations of lexicographic orderings. Journal of Global Optimization. 66(2). 311–329. 1 indexed citations
11.
Terlaky, Tamás, et al.. (2015). Disjunctive conic cuts for mixed integer second order cone optimization. Les Cahiers du GERAD. 1–24. 3 indexed citations
12.
Dearing, P. M., et al.. (2015). A primal algorithm for the weighted minimum covering ball problem in $$\mathbb {R}^n$$ R n. Top. 24(2). 466–492. 2 indexed citations
13.
Mullin, T. J. & Pietro Belotti. (2015). Using branch-and-bound algorithms to optimize selection of a fixed-size breeding population under a relatedness constraint. Tree Genetics & Genomes. 12(1). 9 indexed citations
14.
Malucelli, Federico, et al.. (2013). Quadratic TSP: A lower bounding procedure and a column generation approach. Virtual Community of Pathological Anatomy (University of Castilla La Mancha). 377–384. 2 indexed citations
15.
Belotti, Pietro, et al.. (2013). On families of quadratic surfaces having fixed intersections with two hyperplanes. Discrete Applied Mathematics. 161(16-17). 2778–2793. 18 indexed citations
16.
Belotti, Pietro, et al.. (2010). Valid Inequalities and Convex Hulls for Multilinear Functions. Electronic Notes in Discrete Mathematics. 36. 805–812. 11 indexed citations
17.
Belotti, Pietro, Jon Lee, Leo Liberti, François Margot, & Andreas Wächter. (2009). Branching and bounds tighteningtechniques for non-convex MINLP. Optimization methods & software. 24(4-5). 597–634. 387 indexed citations breakdown →
18.
Belotti, Pietro, et al.. (2007). Design of Multi-Layer Networks with Traffic Grooming and Statistical Multiplexing. Virtual Community of Pathological Anatomy (University of Castilla La Mancha). 1–6.
19.
Kucherenko, Sergei, Pietro Belotti, Leo Liberti, & Nelson Maculan. (2007). New formulations for the Kissing Number Problem. Discrete Applied Mathematics. 155(14). 1837–1841. 15 indexed citations
20.
Belotti, Pietro & Federico Malucelli. (2003). A Lagrangian relaxation approach for the design of networks with shared protection. 1. 72–77. 4 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026