Juan José Miranda Bront

23 papers A* 1C 1Journal 19Unranked 1
YearRankTypeTitle / Venue / Authors
2024 J jnl
A branch-cut-and-price algorithm for the time-dependent electric vehicle routing problem with time windows.
Eur. J. Oper. Res.
Gonzalo Lera-Romero, Juan José Miranda Bront, Francisco J. Soulignac
2023 J jnl
Solving the Traveling Salesman Problem with release dates via branch and cut.
EURO J. Transp. Logist.
Agustín Montero, Isabel Méndez-Díaz, Juan José Miranda Bront
2022 J jnl
Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows.
INFORMS J. Comput.
Gonzalo Lera-Romero, Juan José Miranda Bront, Francisco J. Soulignac
2021 J jnl
A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints.
Eur. J. Oper. Res.
Gonzalo Lera-Romero, Juan José Miranda Bront
2020 J jnl
Linear edge costs and labeling algorithms: The case of the time-dependent vehicle routing problem with time windows.
Networks
Gonzalo Lera-Romero, Juan José Miranda Bront, Francisco J. Soulignac
2019 J jnl
On multi-robot search for a stationary object.
CoRR
Miroslav Kulich, Libor Preucil, Juan José Miranda Bront
2018 J jnl
Integer programming formulations for the time-dependent elementary shortest path problem with resource constraints.
Electron. Notes Discret. Math.
Gonzalo Lera-Romero, Juan José Miranda Bront
2017 J jnl
A cluster-first route-second approach for the swap body vehicle routing problem.
Ann. Oper. Res.
Juan José Miranda Bront, Brian Curcio, Isabel Méndez-Díaz, Agustín Montero, Federico Pousa, Paula Zabala
2017 J jnl
A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment.
Comput. Oper. Res.
Miroslav Kulich, Juan José Miranda Bront, Libor Preucil
2017 J jnl
An ILP-based local search procedure for the VRP with pickups and deliveries.
Ann. Oper. Res.
Agustín Montero, Juan José Miranda Bront, Isabel Méndez-Díaz
2017 J jnl
An integer programming approach for the time-dependent traveling salesman problem with time windows.
Comput. Oper. Res.
Agustín Montero, Isabel Méndez-Díaz, Juan José Miranda Bront
2017 — conf
On multi-robot search for a stationary object.
ECMR
Miroslav Kulich, Libor Preucil, Juan José Miranda Bront
2016 J jnl
An ILP based heuristic for a generalization of the post-enrollment course timetabling problem.
Comput. Oper. Res.
Isabel Méndez-Díaz, Paula Zabala, Juan José Miranda Bront
2015 J jnl
A branch-and-price algorithm for the (
Networks
Enrico Malaguti, Isabel Méndez-Díaz, Juan José Miranda Bront, Paula Zabala
2014 J jnl
A branch-and-cut algorithm for the latent-class logit assortment problem.
Discret. Appl. Math.
Isabel Méndez-Díaz, Juan José Miranda Bront, Gustavo J. Vulcano, Paula Zabala
2014 J jnl
Facets and valid inequalities for the time-dependent travelling salesman problem.
Eur. J. Oper. Res.
Juan José Miranda Bront, Isabel Méndez-Díaz, Paula Zabala
2014 A* conf
Single robot search for a stationary object in an unknown environment.
ICRA
Miroslav Kulich, Libor Preucil, Juan José Miranda Bront
2013 J jnl
(k, c) - coloring via Column Generation.
Electron. Notes Discret. Math.
Enrico Malaguti, Isabel Méndez-Díaz, Juan José Miranda Bront, Paula Zabala
2012 — —
Enfoques de programación entera para el problema del viajante de comercio con costos en función del tiempo
Juan José Miranda Bront
2011 C conf
Infeasible path formulations for the time-dependent TSP with time windows.
CTW
Isabel Méndez-Díaz, Juan José Miranda Bront, Paolo Toth, Paula Zabala
2010 J jnl
A Branch-and-Cut Algorithm for the Latent Class Logit Assortment Problem.
Electron. Notes Discret. Math.
Isabel Méndez-Díaz, Juan José Miranda Bront, Gustavo J. Vulcano, Paula Zabala
2010 J jnl
An integer programming approach for the time-dependent TSP.
Electron. Notes Discret. Math.
Juan José Miranda Bront, Isabel Méndez-Díaz, Paula Zabala
2009 J jnl
A Column Generation Algorithm for Choice-Based Network Revenue Management.
Oper. Res.
Juan José Miranda Bront, Isabel Méndez-Díaz, Gustavo J. Vulcano