Juan José Miranda‐Bront

835 total citations
21 papers, 588 citations indexed

About

Juan José Miranda‐Bront is a scholar working on Industrial and Manufacturing Engineering, Automotive Engineering and Computer Networks and Communications. According to data from OpenAlex, Juan José Miranda‐Bront has authored 21 papers receiving a total of 588 indexed citations (citations by other indexed papers that have themselves been cited), including 16 papers in Industrial and Manufacturing Engineering, 10 papers in Automotive Engineering and 6 papers in Computer Networks and Communications. Recurrent topics in Juan José Miranda‐Bront's work include Vehicle Routing Optimization Methods (15 papers), Transportation and Mobility Innovations (10 papers) and Supply Chain and Inventory Management (4 papers). Juan José Miranda‐Bront is often cited by papers focused on Vehicle Routing Optimization Methods (15 papers), Transportation and Mobility Innovations (10 papers) and Supply Chain and Inventory Management (4 papers). Juan José Miranda‐Bront collaborates with scholars based in Argentina, United States and Italy. Juan José Miranda‐Bront's co-authors include Isabel Méndez‐Díaz, Gustavo Vulcano, Paula Zabala, Libor Přeučil, Miroslav Kulich, Enrico Malaguti and Paolo Toth and has published in prestigious journals such as European Journal of Operational Research, Operations Research and Computers & Operations Research.

In The Last Decade

Juan José Miranda‐Bront

21 papers receiving 570 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Juan José Miranda‐Bront Argentina 12 284 224 216 149 113 21 588
Isabel Méndez‐Díaz Argentina 13 276 1.0× 344 1.5× 214 1.0× 130 0.9× 244 2.2× 28 780
Ek Peng Chew Singapore 11 170 0.6× 188 0.8× 79 0.4× 79 0.5× 102 0.9× 40 482
Paula Zabala Argentina 13 98 0.3× 275 1.2× 84 0.4× 61 0.4× 199 1.8× 28 549
Gregory A. Godfrey United States 5 159 0.6× 156 0.7× 44 0.2× 154 1.0× 110 1.0× 7 434
Mostafa Setak Iran 15 125 0.4× 286 1.3× 76 0.4× 102 0.7× 60 0.5× 51 552
Jason D. Papastavrou United States 11 216 0.8× 322 1.4× 39 0.2× 138 0.9× 108 1.0× 18 667
Thomas Vossen United States 13 131 0.5× 159 0.7× 55 0.3× 30 0.2× 80 0.7× 21 590
Jian-Ya Ding China 12 64 0.2× 620 2.8× 103 0.5× 125 0.8× 80 0.7× 22 884
Kyle Y. Lin United States 14 197 0.7× 40 0.2× 115 0.5× 25 0.2× 144 1.3× 40 544
Matthieu van der Heijden Netherlands 14 137 0.5× 167 0.7× 29 0.1× 105 0.7× 91 0.8× 22 406

Countries citing papers authored by Juan José Miranda‐Bront

Since Specialization
Citations

This map shows the geographic impact of Juan José Miranda‐Bront'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 Juan José Miranda‐Bront with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Juan José Miranda‐Bront more than expected).

Fields of papers citing papers by Juan José Miranda‐Bront

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Juan José Miranda‐Bront. 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 Juan José Miranda‐Bront. The network helps show where Juan José Miranda‐Bront may publish in the future.

Co-authorship network of co-authors of Juan José Miranda‐Bront

This figure shows the co-authorship network connecting the top 25 collaborators of Juan José Miranda‐Bront. A scholar is included among the top collaborators of Juan José Miranda‐Bront 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 Juan José Miranda‐Bront. Juan José Miranda‐Bront 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.
Miranda‐Bront, Juan José, et al.. (2023). A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows. European Journal of Operational Research. 312(3). 978–995. 35 indexed citations
2.
Méndez‐Díaz, Isabel, et al.. (2023). Solving the Traveling Salesman Problem with release dates via branch and cut. EURO Journal on Transportation and Logistics. 12. 100121–100121. 2 indexed citations
3.
Miranda‐Bront, Juan José, et al.. (2020). Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows. Networks. 76(1). 24–53. 13 indexed citations
4.
Miranda‐Bront, Juan José, et al.. (2019). A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints. European Journal of Operational Research. 289(3). 879–896. 8 indexed citations
5.
Miranda‐Bront, Juan José, et al.. (2018). Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints. Electronic Notes in Discrete Mathematics. 69. 53–60. 6 indexed citations
6.
Méndez‐Díaz, Isabel, et al.. (2017). An integer programming approach for the time-dependent traveling salesman problem with time windows. Computers & Operations Research. 88. 280–289. 49 indexed citations
7.
Miranda‐Bront, Juan José, et al.. (2017). An ILP-based local search procedure for the VRP with pickups and deliveries. Annals of Operations Research. 259(1-2). 327–350. 15 indexed citations
8.
Méndez‐Díaz, Isabel, Paula Zabala, & Juan José Miranda‐Bront. (2016). An ILP based heuristic for a generalization of the post-enrollment course timetabling problem. Computers & Operations Research. 76. 195–207. 20 indexed citations
9.
Kulich, Miroslav, Juan José Miranda‐Bront, & Libor Přeučil. (2016). A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment. Computers & Operations Research. 84. 178–187. 11 indexed citations
10.
Miranda‐Bront, Juan José, et al.. (2016). A cluster-first route-second approach for the swap body vehicle routing problem. Annals of Operations Research. 253(2). 935–956. 24 indexed citations
11.
Kulich, Miroslav, Libor Přeučil, & Juan José Miranda‐Bront. (2014). Single robot search for a stationary object in an unknown environment. 3315. 5830–5835. 11 indexed citations
12.
Malaguti, Enrico, Isabel Méndez‐Díaz, Juan José Miranda‐Bront, & Paula Zabala. (2014). A branch‐and‐price algorithm for the (k,c)‐coloring problem. Networks. 65(4). 353–366. 2 indexed citations
13.
Miranda‐Bront, Juan José, Isabel Méndez‐Díaz, & Paula Zabala. (2013). Facets and valid inequalities for the time-dependent travelling salesman problem. European Journal of Operational Research. 236(3). 891–902. 15 indexed citations
14.
Malaguti, Enrico, Isabel Méndez‐Díaz, Juan José Miranda‐Bront, & Paula Zabala. (2013). (k,c) – coloring via Column Generation. Electronic Notes in Discrete Mathematics. 41. 447–454. 1 indexed citations
15.
Méndez‐Díaz, Isabel, Juan José Miranda‐Bront, Gustavo Vulcano, & Paula Zabala. (2012). A branch-and-cut algorithm for the latent-class logit assortment problem. Discrete Applied Mathematics. 164. 246–263. 95 indexed citations
16.
Méndez‐Díaz, Isabel, Juan José Miranda‐Bront, Paolo Toth, & Paula Zabala. (2011). Infeasible path formulations for the time-dependent TSP with time windows.. 198–202. 2 indexed citations
17.
Miranda‐Bront, Juan José, Isabel Méndez‐Díaz, & Paula Zabala. (2010). An integer programming approach for the time-dependent TSP. Electronic Notes in Discrete Mathematics. 36. 351–358. 15 indexed citations
18.
Méndez‐Díaz, Isabel, Juan José Miranda‐Bront, Gustavo Vulcano, & Paula Zabala. (2010). A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem. Electronic Notes in Discrete Mathematics. 36. 383–390. 21 indexed citations
19.
Miranda‐Bront, Juan José, Isabel Méndez‐Díaz, & Gustavo Vulcano. (2009). A Column Generation Algorithm for Choice-Based Network Revenue Management. Operations Research. 57(3). 769–784. 222 indexed citations
20.
Miranda‐Bront, Juan José. (2008). A Column Generation Algorithm for Choice-Based Network Revenue Management. The Faculty Digital Archive (New York University). 11 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

Breakdown of academic impact, for papers by Isabel Méndez‐Díaz Breakdown of academic impact, for papers by Ek Peng Chew Breakdown of academic impact, for papers by Paula Zabala Breakdown of academic impact, for papers by Gregory A. Godfrey Breakdown of academic impact, for papers by Mostafa Setak Breakdown of academic impact, for papers by Jason D. Papastavrou Breakdown of academic impact, for papers by Thomas Vossen Breakdown of academic impact, for papers by Jian-Ya Ding Breakdown of academic impact, for papers by Kyle Y. Lin Breakdown of academic impact, for papers by Matthieu van der Heijden
Rankless by CCL
2026