A Column Generation Algorithm for Choice-Based Network Revenue Management. - Juan José Miranda Bront; Isabel Méndez-Díaz; Gustavo J. Vulcano (Oper. Res., 2009)

An integer programming approach for the time-dependent TSP. - Juan José Miranda Bront; Isabel Méndez-Díaz; Paula Zabala (Electron. Notes Discret. Math., 2010)

Infeasible path formulations for the time-dependent TSP with time windows. - Isabel Méndez-Díaz; Juan José Miranda Bront; Paolo Toth; Paula Zabala (CTW, 2011)

Enfoques de programación entera para el problema del viajante de comercio con costos en función del tiempo - Juan José Miranda Bront (2012)

(k, c) - coloring via Column Generation. - Enrico Malaguti; Isabel Méndez-Díaz; Juan José Miranda Bront; Paula Zabala (Electron. Notes Discret. Math., 2013)

Single robot search for a stationary object in an unknown environment. - Miroslav Kulich; Libor Preucil; Juan José Miranda Bront (ICRA, 2014)

A branch-and-cut algorithm for the latent-class logit assortment problem. - Isabel Méndez-Díaz; Juan José Miranda Bront; Gustavo J. Vulcano; Paula Zabala (Discret. Appl. Math., 2014)

Facets and valid inequalities for the time-dependent travelling salesman problem. - Juan José Miranda Bront; Isabel Méndez-Díaz; Paula Zabala (Eur. J. Oper. Res., 2014)

A branch-and-price algorithm for the (k, c)-coloring problem. - Enrico Malaguti; Isabel Méndez-Díaz; Juan José Miranda Bront; Paula Zabala (Networks, 2015)

An ILP based heuristic for a generalization of the post-enrollment course timetabling problem. - Isabel Méndez-Díaz; Paula Zabala; Juan José Miranda Bront (Comput. Oper. Res., 2016)

On multi-robot search for a stationary object. - Miroslav Kulich; Libor Preucil; Juan José Miranda Bront (ECMR, 2017)

A cluster-first route-second approach for the swap body vehicle routing problem. - Juan José Miranda Bront; Brian Curcio; Isabel Méndez-Díaz; Agustín Montero; Federico Pousa; Paula Zabala (Ann. Oper. Res., 2017)

An ILP-based local search procedure for the VRP with pickups and deliveries. - Agustín Montero; Juan José Miranda Bront; Isabel Méndez-Díaz (Ann. Oper. Res., 2017)

A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment. - Miroslav Kulich; Juan José Miranda Bront; Libor Preucil (Comput. Oper. Res., 2017)

An integer programming approach for the time-dependent traveling salesman problem with time windows. - Agustín Montero; Isabel Méndez-Díaz; Juan José Miranda Bront (Comput. Oper. Res., 2017)

Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints. - Gonzalo Lera-Romero; Juan José Miranda Bront (Electron. Notes Discret. Math., 2018)

Linear edge costs and labeling algorithms: The case of the time-dependent vehicle routing problem with time windows. - Gonzalo Lera-Romero; Juan José Miranda Bront; Francisco J. Soulignac (Networks, 2020)

A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints. - Gonzalo Lera-Romero; Juan José Miranda Bront (Eur. J. Oper. Res., 2021)

Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows. - Gonzalo Lera-Romero; Juan José Miranda Bront; Francisco J. Soulignac (INFORMS J. Comput., 2022)

Solving the Traveling Salesman Problem with release dates via branch and cut. - Agustín Montero; Isabel Méndez-Díaz; Juan José Miranda Bront (EURO J. Transp. Logist., 2023)

A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows. - Gonzalo Lera-Romero; Juan José Miranda Bront; Francisco J. Soulignac (Eur. J. Oper. Res., 2024)