Get started
Author

Juan José Miranda‐Bront

Observed names: J.J. Miranda-Bront, Juan J. Miranda Bront, Juan Jose Miranda Bront, Juan José Miranda Bront, Juan José Miranda-Bront, Miranda Bront, Juan José, Miranda-Bront, Juan José
ORCID: 0000-0001-9125-7028
Observed ORCID: 0000-0001-9125-7028
OpenAlex ID: A5060102139
A Column Generation Algorithm for Choice-Based Network Revenue Management
2009 · Juan José Miranda Bront, Isabel Méndez-Díaz, et al. · Operations Research · 299
A branch-and-cut algorithm for the latent-class logit assortment problem
2012 · Isabel Méndez-Díaz, Juan José Miranda-Bront, et al. · Discrete Applied Mathematics · 123
PDF
A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows
2023 · Gonzalo Lera-Romero, Juan José Miranda Bront, et al. · European Journal of Operational Research · 94
An integer programming approach for the time-dependent traveling salesman problem with time windows
2017 · Agustín Montero, Isabel Méndez-Díaz, et al. · Computers & Operations Research · 66
PDF
A cluster-first route-second approach for the swap body vehicle routing problem
2016 · Juan José Miranda-Bront, Brian Curcio, et al. · Annals of Operations Research · 48
Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows
2022 · Gonzalo Lera-Romero, Juan José Miranda Bront, et al. · INFORMS journal on computing · 28
An ILP based heuristic for a generalization of the post-enrollment course timetabling problem
2016 · Isabel Méndez-Díaz, Paula Zabala, et al. · Computers & Operations Research · 28
PDF
An ILP-based local search procedure for the VRP with pickups and deliveries
2017 · Agustín Montero, Juan José Miranda-Bront, et al. · Annals of Operations Research · 23
PDF
A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem
2010 · Isabel Méndez-Díaz, Juan José Miranda-Bront, et al. · Electronic Notes in Discrete Mathematics · 23
Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows
2020 · Gonzalo Lera‐Romero, Juan J. Miranda Bront, et al. · Networks · 22
An integer programming approach for the time-dependent TSP
2010 · Juan José Miranda-Bront, Isabel Méndez-Díaz, et al. · Electronic Notes in Discrete Mathematics · 21
PDF
A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment
2016 · Miroslav Kulich, Juan José Miranda-Bront, et al. · Computers & Operations Research · 19
Facets and valid inequalities for the time-dependent travelling salesman problem
2013 · Juan José Miranda-Bront, Isabel Méndez-Díaz, et al. · European Journal of Operational Research · 17
A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints
2019 · Gonzalo Lera-Romero, Juan José Miranda-Bront · European Journal of Operational Research · 16
Single robot search for a stationary object in an unknown environment
2014 · Miroslav Kulich, Libor Preucil, et al. · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · 14
A Column Generation Algorithm for Choice-Based Network Revenue Management
2008 · Juan José Miranda‐Bront · Faculty Digital Archive (New York University Florence) · 13
PDF
Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints
2018 · Gonzalo Lera-Romero, Juan José Miranda-Bront · Electronic Notes in Discrete Mathematics · 7
PDF
Solving the Traveling Salesman Problem with release dates via branch and cut
2023 · Agustín Montero, Isabel Méndez-Díaz, et al. · EURO Journal on Transportation and Logistics · 5
A branch‐and‐price algorithm for the (k,c)‐coloring problem
2014 · Enrico Malaguti, Isabel Méndez‐Díaz, et al. · Networks · 4
PDF
On parallel machine scheduling with variable energy consumption functions
2024 · Mucciarini, Mirko, Caselli, Giulia, et al. · arXiv (Cornell University) · 3
PDF
Infeasible path formulations for the time-dependent TSP with time windows.
2011 · Isabel Méndez‐Díaz, Juan José Miranda‐Bront, et al. · Cologne Twente Workshop on Graphs and Combinatorial Optimization · 2
(k,c) – coloring via Column Generation
2013 · E. Malaguti, I. Méndez-Díaz, et al. · Electronic Notes in Discrete Mathematics · 1
PDF
Integrando giras en torneos double round robing: modelos, heurísticas y un caso de estudio
2025 · García Aramouni, Nicolás, Miranda Bront, Juan José · JAIIO, Jornadas Argentinas de Informática
PDF
Heurísticas basadas en búsqueda local para el problema de ruteo de vehículos con suavizado en el depósito de llegada
2025 · Carreiro, Martín, De Souza, Cid, et al. · JAIIO, Jornadas Argentinas de Informática
PDF
Integrando giras en torneos double round robing: modelos, heurísticas y un caso de estudio
2025 · Aramouni, Nicolás García, Miranda Bront, Juan José · El Servicio de Difusión de la Creación Intelectual (National University of La Plata)
Works count: 34
Citation count: 876
H-index: 14
I10-index: 16
Year
Topic
Type