default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJuan José Miranda Bront
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]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): 978-995 (2024)- 2023
- [j17]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: 100121 (2023) - 2022
- [j16]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): 3292-3308 (2022) - 2021
- [j15]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): 879-896 (2021) - 2020
- [j14]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): 24-53 (2020)
2010 – 2019
- 2019
- [i1]Miroslav Kulich, Libor Preucil, Juan José Miranda Bront:
On multi-robot search for a stationary object. CoRR abs/1901.07434 (2019) - 2018
- [j13]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: 53-60 (2018) - 2017
- [j12]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): 935-956 (2017) - [j11]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): 327-350 (2017) - [j10]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: 178-187 (2017) - [j9]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: 280-289 (2017) - [c3]Miroslav Kulich, Libor Preucil, Juan José Miranda Bront:
On multi-robot search for a stationary object. ECMR 2017: 1-6 - 2016
- [j8]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: 195-207 (2016) - 2015
- [j7]Enrico Malaguti, Isabel Méndez-Díaz, Juan José Miranda Bront, Paula Zabala:
A branch-and-price algorithm for the (k, c)-coloring problem. Networks 65(4): 353-366 (2015) - 2014
- [j6]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: 246-263 (2014) - [j5]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): 891-902 (2014) - [c2]Miroslav Kulich, Libor Preucil, Juan José Miranda Bront:
Single robot search for a stationary object in an unknown environment. ICRA 2014: 5830-5835 - 2013
- [j4]Enrico Malaguti, Isabel Méndez-Díaz, Juan José Miranda Bront, Paula Zabala:
(k, c) - coloring via Column Generation. Electron. Notes Discret. Math. 41: 447-454 (2013) - 2011
- [c1]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: 198-202 - 2010
- [j3]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: 351-358 (2010) - [j2]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: 383-390 (2010)
2000 – 2009
- 2009
- [j1]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): 769-784 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-08 22:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
