Juan José Miranda-Bront bio photo

Juan José Miranda-Bront

CS, OR, Math. Prog. Transportation. Researcher @ CONICET/UTDT. Basketball veteran.

Email LinkedIn Google Scholar Research Gate

Research

Overview

Publications

  1. G. Lera-Romero, J. J. Miranda Bront, F. Soulignac, A Branch-Cut-and-Price Algorithm for the Time-Dependent Electric Vehicle Routing Problem with Time Windows, European Journal of Operational Research (In Press), 2024.
    [doi]

  2. A. Montero, I. Méndez-Díaz, J. J. Miranda Bront, Solving the Traveling Salesman Problem with release dates via branch-and-cut, EURO Journal on Transportation and Logistics (In Press), 2023.
    [doi]

  3. G. Lera-Romero, J. J. Miranda Bront, F. Soulignac, Dynamic programming for the time-dependent traveling salesman problem with time windows, INFORMS Journal of Computing, 34(6):3292–3308, 2022.
    [doi]

  4. G. Lera-Romero, J. J. Miranda Bront, A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints, European Journal of Operational Research 289(3), 879–896, 2021.
    [doi]

  5. G. Lera-Romero, J. J. Miranda Bront, F. Soulignac, Linear edge costs and labeling algorithms: The case of the time-dependent vehicle routing problem with time windows, Networks 76(1), 879–896, 2020.
    [doi]

  6. A. Montero, I. Méndez-Díaz, J. J. Miranda Bront, An Integer Programming approach for the Time-Dependent Traveling Salesman Problem with Time Windows, Computers and Operations Research 88, 280-289, 2017.
    [doi]

  7. A. Montero, I. Méndez-Díaz, J. J. Miranda Bront, An ILP-based local search procedure for the VRP with pickup and deliveries, Annals of Operations Research 259, 327-350, 2017.
    [doi]

  8. J. J. Miranda Bront, B. Curcio, A. Montero, I. Méndez-Díaz, F. Pousa, P. Zabala, A cluster-first route-second approach for the Swap Body Vehicle Routing Problem, Annals of Operations Research 253, 935–956, 2017.
    [doi]

  9. M. Kulich, J. J. Miranda Bront, L. Preucil, A Meta-heuristic based Goal-Selection Strategy for Mobile Robot Search in an Unknown Environment, Computers and Operations Research 84, 178-187, 2017.
    [doi]

  10. I. Méndez-Díaz, P. Zabala, J. J. Miranda Bront, An ILP based heuristic for a generalization of the post-enrollment course timetabling problem, Computers and Operations Research 76, 195-207, 2016.
    [doi]

  11. E. Malaguti, I. Méndez-Díaz, J.J. Miranda Bront, P. Zabala, A branch-and-price algorithm for the (k, c)-coloring problem, Networks 65(4), 353-366, 2015.
    [doi]

  12. J. J. Miranda Bront, I. Méndez-Díaz, P. Zabala, Facets and valid inequalities for the time-dependent travelling salesman problem, European Journal of Operational Research 236(3), 891-902, 2014.
    [doi]

  13. I. Méndez-Díaz, J. J. Miranda Bront, G. Vulcano, P. Zabala, A Branch-and-Cut Algorithm for the Latent-Class Logit Assortment Problem, Discrete Applied Mathematics 164(1), 246-263, 2014.
    [doi]

  14. J. J. Miranda Bront, I. Méndez-Díaz, G. Vulcano, A column generation algorithm for choice-based network revenue management, Operations Research, Vol. 57(3), 769-784, 2009.
    [doi]

Short papers and conference proceedings

  1. G. Lera-Romero, J. J. Miranda Bront, Solving a Joint Vehicle Routing and Generalized Assignment Problem via Column Generation, Proceedings of the 9th International Workshop on Freight Transportation and Logistics, 2024.[link to proceedings]

  2. M. Mucciarini, G. Caselli, D. De Santis, M. Iori, J. J. Miranda Bront, Integer Linear Programming for energy-efficient scheduling with time-dependent consumption functions, Proceedings of the International Network Optimization Conference (INOC) 2024.[link to proceedings]

  3. N. García Aramouni, J. J. Miranda Bront, Rescheduling the NBA regular season via Integer Programming, Proceedings of the MathSport International 9 Conference, 2022.[link to proceedings]

  4. N. García Aramouni, J. J. Miranda Bront, Sports scheduling and managerial aspects: insights for Argentina’s National Basketball League, Proceedings of the MathSport International 8 Conference, 2021 (virtual).[link to proceedings]

  5. G. Lera-Romero, J. J. Miranda Bront, Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints, Electronic Notes on Discrete Mathematics 69, 53-60, 2018. Proceedings of the EUROALIO 2018.
    [doi]

  6. A. Montero, I. Méndez-Díaz, J. J. Miranda Bront, An Integer Programming approach for the Time-Dependent Traveling Salesman Problem with Time Windows, First Triennial Conference of the INFORMS Transportation Science and Logistics Society, Chicago, United States, 2017. [Extended Abstract]

  7. I. Méndez-Díaz, J. J. Miranda Bront, P. Toth, P. Zabala, A Branch-and-Cut algorithm for the time-dependent travelling salesman problem with time windows, ALIO/EURO 2014, Montevideo, Uruguay, December 2014, Extended Abstract.

  8. I. Méndez-Díaz, P. Zabala, J. J. Miranda Bront, An ILP based heuristic for a generalization of the post-enrollment course timetabling problem, ALIO/EURO 2014, Montevideo, Uruguay, December 2014, Extended Abstract.

  9. M. Kulich, L. Preucil, J. J. Miranda Bront, Single Robot Search for a Stationary Object in an Unknown Environment, 2014 IEEE International Conference on Robotics and Automation (ICRA 2014), Hong Kong, China, January 2014.
    [doi]

  10. E. Malaguti, I. Méndez-Díaz, J.J. Miranda Bront, P. Zabala, (k, c)-coloring problem via column generation, Electronic Notes on Discrete Mathematics 41, 447-454, 2013.
    [doi]

  11. I. Méndez-Díaz, J. J. Miranda Bront, P. Toth, P. Zabala, Infeasible path formulations for the time-dependent TSP with time windows, Proceedings of the 10-th Cologne-Twente Workshop on graphs and combinatorial optimization, 198-203, Italia, 2011, Extended Abstract.
    [link]

  12. J. J. Miranda Bront, I. Méndez-Díaz, P. Zabala, An integer programming approach for the Time-Dependent Travelling Salesman Problem, Electronic Notes on Discrete Mathematics 36, 351-358, 2010.
    [doi]

  13. I. Méndez-Díaz, J. J. Miranda Bront, G. Vulcano, P. Zabala, A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem, Electronic Notes on Discrete Mathematics 36, 383-390, 2010.
    [doi]

  14. J. J. Miranda Bront, I. Méndez-Díaz, A Cut and Branch algorithm for the Time-Dependent Travelling Salesman Problem, VI ALIO/EURO Workshop on Applied Combinatorial Optimization, Buenos Aires, Argentina, 2008, Extended Abstract.

Working papers

  1. M. Mucciarini, G. Caselli, D. De Santis, M. Iori, J. J. Miranda Bront, On incorporating variable consumption functions within energy-efficient parallel machine scheduling. Second round review, 2025.

Ongoing research

  1. N. García Aramouni, J. J. Miranda Bront, Integrating tours in time-constrained sport schedules.

  2. C. Carvalho de Souza, J. Marenco, J. J. Miranda Bront, D. Negrotto, J. Silvestri, G. Slucki, Local Search-based algorithms for a rich vehicle routing problem with depot processing capacities.

Dissertations

  1. Integer programming approaches to the Time Dependent Travelling Salesman Problem, 2012. [download]

  2. A column generation algorithm for choice-based network revenue management, 2007. [download] (in Spanish)

Talks

Conference presentations

  1. M. Carreiro, J. Marenco, J.J. Miranda Bront, J. Silvestri, G. Slucki, Heuristics for the Multi-trip vehicle routing problem with depot smoothing, EURO Working Group on Vehicle Routing and Logistics Optimization 2025 (VeRoLog 2025), Trento, Italy, 2025.

  2. N. García Aramouni, J. J. Miranda Bront, Rescheduling the NBA regular season via Integer Programming, 23rd Conference of the International Federation of Operational Research Societies, Santiago de Chile, Chile, 2023.

  3. G. Lera-Romero, J. J. Miranda Bront, F. Soulignac, A Branch-Cut-and-Price Algorithm for the Time-Dependent Electric Vehicle Routing Problem with Time Windows, 9th INFORMS Transportation Science and Logistics Society Workshop (Virtual), Indian Institute of Management Ahmedabad, India, 2021.

  4. A. Montero, I. Méndez-Díaz, J. J. Miranda Bront, An Integer Programming approach for the Traveling Salesman Problem with release dates and completion time minimization, International Conference on Computational Logistics 2020 (ICCL 2020), virtual, 2020.

  5. G. Lera-Romero, J. J. Miranda Bront, F. Soulignac, Dynamic programming for the time-dependent traveling salesman problem with time windows, International Conference on Computational Logistics 2020 (ICCL 2020), virtual, 2020.

  6. G. Lera-Romero, J. J. Miranda Bront, F. Soulignac, An Enhanced Branch and Price Algorithm for the Time-Dependent Vehicle Routing Problem with Time Windows, EURO Working Group on Vehicle Routing and Logistics Optimization 2019 (VeRoLog 2019), Seville, Spain, 2019.

  7. I. Méndez-Díaz, J. J. Miranda Bront, G. Vulcano, CDLP-based bid prices for network revenue management, INFORMS Annual Meeting 2018, Phoenix, United States, 2018.

  8. J. J. Miranda Bront, G. Lera Romero, Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints, EUROALIO 2018, Bologna, Italy, 2018.

  9. A. Mosteiro, J. J. Miranda Bront, F. Pousa, ILP formulations for the railway rescheduling problem under large disruptions, ISCO 2016, Salerno, Italy, 2016.

  10. I. Méndez-Díaz, J. J. Miranda Bront, P. Toth, P. Zabala, A Branch-and-Cut algorithm for the time-dependent travelling salesman problem with time windows, ALIO/EURO 2014, Montevideo, Uruguay, 2014.

  11. I. Méndez-Díaz, P. Zabala, J. J. Miranda Bront, An ILP based heuristic for a generalization of the post-enrollment course timetabling problem, ALIO/EURO 2014, Montevideo, Uruguay, 2014.

  12. A. Montero, I. Méndez-Díaz, J. J. Miranda Bront, An ILP-based heuristic for the VRP with pickups and deliveries, 3rd International Symposium on Combinatorial Optimization (ISCO 2014), Lisbon, Portugal, 2014.

  13. I. Méndez-Díaz, J. J. Miranda Bront, P. Toth, P. Zabala, Infeasible path formulations for the time-dependent TSP with time windows, 10-th Cologne-Twente Workshop on graphs and combinatorial optimization, Frascati, Italy, 2011.

  14. J. J. Miranda Bront, I. Méndez-Díaz, P. Zabala, An integer programming approach for the Time-Dependent Travelling Salesman Problem, International Symposium on Combinatorial Optimization (ISCO 2010), Hammamet, Tunisia, 2010.

  15. I. Méndez-Díaz, J. J. Miranda Bront, G. Vulcano, P. Zabala, A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem, International Symposium on Combinatorial Optimization (ISCO 2010), Hammamet, Tunisia, 2010.

  16. J. J. Miranda Bront, I. Méndez-Díaz, P. Zabala, An Integer Programming Approach for the Time-dependent TSP, ALIO-INFORMS 2010, Buenos Aires, Argentina, 2010.

  17. J. J. Miranda Bront, I. Méndez-Díaz, P. Zabala, An integer programming approach for the time dependent travelling salesman problem, 23rd European Conference on Operational Research, Bonn, Germany, 2009.

  18. I. Méndez-Díaz, J. J. Miranda Bront, G. Vulcano, P. Zabala, A branch and cut algorithm for the product assortment problem under customer choice behavior, 23rd European Conference on Operational Research, Bonn, Germany, 2009.

  19. J. J. Miranda Bront, I. Méndez-Díaz, G. Vulcano, Un algoritmo de generación de columnas para la gestión de ingresos bajo preferencias de clientes, XIV CLAIO, Cartagena de Indias, Colombia, 2008.

  20. I. Méndez-Díaz, J. J. Miranda Bront, G. Vulcano, P. Zabala, Product Assortment Under Choice Behaviour, INFORMS Annual Meeting 2008, Washington D.C., United States, 2008.

  21. J. J. Miranda Bront, I. Méndez-Díaz, G. Vulcano, A column generation algorithm for the choice-based linear programming model for network revenue management, 19th International Symposium on Mathematical Programming, Rio de Janeiro, Brazil, 2006.

Invited seminars

  1. A Branch-Cut-and-Price Algorithm for the Time-Dependent Electric Vehicle Routing Problem with Time Windows, DEI, University of Bologna, 2023.

  2. A Branch-Cut-and-Price Algorithm for the Time-Dependent Electric Vehicle Routing Problem with Time Windows, Supply Chain & Optimization Technologies (SOT) group, Mercado Libre, 2021.

  3. Optimization techniques applied to distribution problems under congestion, Eindhoven University of Technology, Netherlands, 2018.

  4. Traveling Deliveryman Problem applied to single-robot search in an unknown environment, Faculty of Engineering, University of Bologna, Italy, 2015.

  5. Infeasible path formulations for the time-dependent TSP with time windows, Faculty of Engineering, University of Bologna, Italy, 2011.

  6. An integer programming approach for the time-dependent TSP, Faculty of Engineering, University of Reggio-Emilia, Italy, 2011.

  7. A column generation algorithm for the choice-based network revenue management, AGIFORS Annual Symposium, Bangkok, Thailand, 2007.