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, 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]

  2. 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]

  3. 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]

  4. 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]

  5. 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]

  6. 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]

  7. 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]

  8. 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]

  9. 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]

  10. 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]

  11. 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. 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]

  2. 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. [doi]

  3. 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]

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

  5. 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.

  6. 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]

  7. 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]

  8. 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]

  9. 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]

  10. 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]

  11. 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. G. Lera-Romero, J. J. Miranda Bront, F. Soulignac, Dynamic programming for the time- dependent traveling salesman problem with time windows. Minor revision, INFORMS Journal of Computing, 04/2022. [draft]

  2. 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. [draft]

  3. A. Montero, I. Méndez-Díaz, J. J. Miranda Bront, Solving the Traveling Salesman Problem with release dates via branch-and-cut. [draft]

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