| A column generation algorithm for choice-based network revenue management JJM Bront, I Méndez-Díaz, G Vulcano Operations research 57 (3), 769-784, 2009 | 421 | 2009 |
| A branch-and-cut algorithm for the latent-class logit assortment problem I Méndez-Díaz, JJ Miranda-Bront, G Vulcano, P Zabala Discrete Applied Mathematics 164, 246-263, 2014 | 171* | 2014 |
| An integer programming approach for the time-dependent traveling salesman problem with time windows A Montero, I Méndez-Díaz, JJ Miranda-Bront Computers & Operations Research 88, 280-289, 2017 | 83 | 2017 |
| A cluster-first route-second approach for the swap body vehicle routing problem JJ Miranda-Bront, B Curcio, I Méndez-Díaz, A Montero, F Pousa, P Zabala Annals of Operations Research 253, 935-956, 2017 | 46 | 2017 |
| A branch-and-cut algorithm for the latent class logit assortment problem I Méndez-Díaz, JJ Miranda-Bront, G Vulcano, P Zabala Electronic Notes in Discrete Mathematics 36, 383-390, 2010 | 37 | 2010 |
| A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows G Lera-Romero, JJM Bront, FJ Soulignac European Journal of Operational Research 312 (3), 978-995, 2024 | 32 | 2024 |
| An ILP based heuristic for a generalization of the post-enrollment course timetabling problem I Méndez-Díaz, P Zabala, JJ Miranda-Bront Computers & Operations Research 76, 195-207, 2016 | 32 | 2016 |
| An integer programming approach for the time-dependent TSP JJ Miranda-Bront, I Mendez-Diaz, P Zabala Electronic Notes in Discrete Mathematics 36, 351-358, 2010 | 30 | 2010 |
| Facets and valid inequalities for the time-dependent travelling salesman problem JJ Miranda-Bront, I Méndez-Díaz, P Zabala European Journal of Operational Research 236 (3), 891-902, 2014 | 28 | 2014 |
| A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment M Kulich, JJ Miranda-Bront, L Přeučil Computers & Operations Research 84, 178-187, 2017 | 27 | 2017 |
| Dynamic programming for the time-dependent traveling salesman problem with time windows G Lera-Romero, JJ Miranda Bront, FJ Soulignac INFORMS Journal on Computing 34 (6), 3292-3308, 2022 | 25 | 2022 |
| An ILP-based local search procedure for the VRP with pickups and deliveries AI Montero, JJ Miranda-Bront, I Méndez-Dıaz | 25 | 2015 |
| Single robot search for a stationary object in an unknown environment M Kulich, L Přeućil, JJM Bront 2014 IEEE International Conference on Robotics and Automation (ICRA), 5830-5835, 2014 | 25 | 2014 |
| Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows G Lera‐Romero, JJ Miranda Bront, FJ Soulignac Networks 76 (1), 24-53, 2020 | 20 | 2020 |
| A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints G Lera-Romero, JJ Miranda-Bront European Journal of Operational Research 289 (3), 879-896, 2021 | 17 | 2021 |
| Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints G Lera-Romero, JJ Miranda-Bront Electronic Notes in Discrete Mathematics 69, 53-60, 2018 | 10 | 2018 |
| On multi-robot search for a stationary object M Kulich, L Přeučil, JJM Bront 2017 European Conference on Mobile Robots (ECMR), 1-6, 2017 | 8 | 2017 |
| An integer programming approach for the time-dependent TSP. JJM Bront, I Méndez-Díaz, P Zabala Electron. Notes Discret. Math. 36, 351-358, 2010 | 7 | 2010 |
| An enhanced branch and price algorithm for the time-dependent vehicle routing problem with time window G Lera-Romero, JJM Bront, FJ Soulignac Optimization Online, 2018 | 6 | 2018 |
| Infeasible path formulations for the time-dependent TSP with time windows I Méndez-Dıaz, JJM Bront, P Toth, P Zabala Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial …, 2011 | 5 | 2011 |
Paula ZabalaUniversidad de Buenos AiresVerified email at dc.uba.ar
