Juan José Miranda Bront

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 13

Top Topics

Traveling Salesman Problem

Valid Inequalities

Routing Problem

Top Venues

Comput. Oper. Res.

Eur. J. Oper. Res.

Ann. Oper. Res.

Publications

Gonzalo Lera-Romero, Juan José Miranda Bront, Francisco J. Soulignac
A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows. Eur. J. Oper. Res. 312 (3) (2024)
Agustín Montero, Isabel Méndez-Díaz, Juan José Miranda Bront
Solving the Traveling Salesman Problem with release dates via branch and cut. EURO J. Transp. Logist. 12 (2023)
Gonzalo Lera-Romero, Juan José Miranda Bront, Francisco J. Soulignac
Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows. INFORMS J. Comput. 34 (6) (2022)
Gonzalo Lera-Romero, Juan José Miranda Bront
A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints. Eur. J. Oper. Res. 289 (3) (2021)
Gonzalo Lera-Romero, Juan José Miranda Bront, Francisco J. Soulignac
Linear edge costs and labeling algorithms: The case of the time-dependent vehicle routing problem with time windows. Networks 76 (1) (2020)
Miroslav Kulich, Libor Preucil, Juan José Miranda Bront
On multi-robot search for a stationary object. CoRR (2019)
Gonzalo Lera-Romero, Juan José Miranda Bront
Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints. Electron. Notes Discret. Math. 69 (2018)
Juan José Miranda Bront, Brian Curcio, Isabel Méndez-Díaz, Agustín Montero, Federico Pousa, Paula Zabala
A cluster-first route-second approach for the swap body vehicle routing problem. Ann. Oper. Res. 253 (2) (2017)
Miroslav Kulich, Libor Preucil, Juan José Miranda Bront
On multi-robot search for a stationary object. ECMR (2017)
Miroslav Kulich, Juan José Miranda Bront, Libor Preucil
A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment. Comput. Oper. Res. 84 (2017)
Agustín Montero, Juan José Miranda Bront, Isabel Méndez-Díaz
An ILP-based local search procedure for the VRP with pickups and deliveries. Ann. Oper. Res. 259 (1-2) (2017)
Agustín Montero, Isabel Méndez-Díaz, Juan José Miranda Bront
An integer programming approach for the time-dependent traveling salesman problem with time windows. Comput. Oper. Res. 88 (2017)
Isabel Méndez-Díaz, Paula Zabala, Juan José Miranda Bront
An ILP based heuristic for a generalization of the post-enrollment course timetabling problem. Comput. Oper. Res. 76 (2016)
Enrico Malaguti, Isabel Méndez-Díaz, Juan José Miranda Bront, Paula Zabala
)-coloring problem. Networks 65 (4) (2015)
Miroslav Kulich, Libor Preucil, Juan José Miranda Bront
Single robot search for a stationary object in an unknown environment. ICRA (2014)
Juan José Miranda Bront, Isabel Méndez-Díaz, Paula Zabala
Facets and valid inequalities for the time-dependent travelling salesman problem. Eur. J. Oper. Res. 236 (3) (2014)
Isabel Méndez-Díaz, Juan José Miranda Bront, Gustavo J. Vulcano, Paula Zabala
A branch-and-cut algorithm for the latent-class logit assortment problem. Discret. Appl. Math. 164 (2014)
Enrico Malaguti, Isabel Méndez-Díaz, Juan José Miranda Bront, Paula Zabala
(k, c) - coloring via Column Generation. Electron. Notes Discret. Math. 41 (2013)
Isabel Méndez-Díaz, Juan José Miranda Bront, Paolo Toth, Paula Zabala
Infeasible path formulations for the time-dependent TSP with time windows. CTW (2011)
Isabel Méndez-Díaz, Juan José Miranda Bront, Gustavo J. Vulcano, Paula Zabala
A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem. Electron. Notes Discret. Math. 36 (2010)
Juan José Miranda Bront, Isabel Méndez-Díaz, Paula Zabala
An integer programming approach for the time-dependent TSP. Electron. Notes Discret. Math. 36 (2010)
Juan José Miranda Bront, Isabel Méndez-Díaz, Gustavo J. Vulcano
A Column Generation Algorithm for Choice-Based Network Revenue Management. Oper. Res. 57 (3) (2009)