default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMaria Albareda-Sambola
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j21]Maria Albareda-Sambola, Mercedes Landete
, Juan F. Monge, José L. Sainz-Pardo:
An exact approach for the reliable fixed-charge location problem with capacity constraints. Eur. J. Oper. Res. 311(1): 24-35 (2023)- [i4]Maria Albareda-Sambola, Elena Fernández, Francisco Saldanha-da-Gama:
Outsourcing policies for the Facility Location Problem with Bernoulli Demand. CoRR abs/2310.18981 (2023) - 2022
- [i3]Maria Albareda-Sambola, Marta Baldomero-Naranjo, Juan Manuel Muñoz-Ocaña, Jessica Rodríguez-Pereira:
Proceedings of the XI International Workshop on Locational Analysis and Related Problems. CoRR abs/2202.13878 (2022) - 2020
- [i2]Maria Albareda-Sambola, Marta Baldomero-Naranjo, Luisa I. Martínez-Merino, Diego Ponce, Miguel A. Pozo, Justo Puerto, Victoria Rebillas-Loredo:
Proceedings of the X International Workshop on Locational Analysis and Related Problems. CoRR abs/2002.01702 (2020) - [i1]Maria Albareda-Sambola, Luisa I. Martínez-Merino, Antonio M. Rodríguez-Chía:
Proceedings of the VI International Workshop on Locational Analysis and Related Problems. CoRR abs/2002.08287 (2020)
2010 – 2019
- 2019
- [j20]Maria Albareda-Sambola, Luisa I. Martínez-Merino, Antonio M. Rodríguez-Chía:
The stratified p-center problem. Comput. Oper. Res. 108: 213-225 (2019) - [j19]Maria Albareda-Sambola, Alfredo Marín, Antonio M. Rodríguez-Chía:
Reformulated acyclic partitioning for rail-rail containers transshipment. Eur. J. Oper. Res. 277(1): 153-165 (2019) - [j18]Oriol Lordan, Maria Albareda-Sambola:
Exact calculation of network robustness. Reliab. Eng. Syst. Saf. 183: 276-280 (2019) - 2017
- [j17]Maria Albareda-Sambola, Mercedes Landete, Juan F. Monge, José L. Sainz-Pardo:
Introducing capacities in the location of unreliable facilities. Eur. J. Oper. Res. 259(1): 175-188 (2017) - [j16]Luisa I. Martínez-Merino, Maria Albareda-Sambola, Antonio M. Rodríguez-Chía:
The probabilistic p-center problem: Planning service for potential customers. Eur. J. Oper. Res. 262(2): 509-520 (2017) - [j15]Maria Albareda-Sambola, Elena Fernández, Francisco Saldanha-da-Gama:
Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands. INFORMS J. Comput. 29(4): 737-753 (2017) - 2015
- [j14]Efrain Ruiz, Maria Albareda-Sambola, Elena Fernández, Mauricio G. C. Resende:
A biased random-key genetic algorithm for the capacitated minimum spanning tree problem. Comput. Oper. Res. 57: 95-108 (2015) - [j13]Maria Albareda-Sambola, Yolanda Hinojosa, Alfredo Marín, Justo Puerto:
When centers can fail: A close second opportunity. Comput. Oper. Res. 62: 145-156 (2015) - [j12]Maria Albareda-Sambola, Yolanda Hinojosa, Justo Puerto:
The reliable p-median problem with at-facility service. Eur. J. Oper. Res. 245(3): 656-666 (2015) - 2014
- [j11]Maria Albareda-Sambola, Elena Fernández, Gilbert Laporte:
The dynamic multiperiod vehicle routing problem with probabilistic information. Comput. Oper. Res. 48: 31-39 (2014) - 2013
- [j10]Maria Albareda-Sambola, Antonio Alonso-Ayuso, Laureano F. Escudero, Elena Fernández, Celeste Pizarro:
Fix-and-Relax-Coordination for a multi-period location-allocation problem under uncertainty. Comput. Oper. Res. 40(12): 2878-2892 (2013) - 2012
- [j9]Maria Albareda-Sambola, Elena Fernández, Stefan Nickel:
Multiperiod Location-Routing with Decoupled Time Scales. Eur. J. Oper. Res. 217(2): 248-258 (2012) - 2011
- [j8]Maria Albareda-Sambola, Elena Fernández, Gilbert Laporte:
A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem. Comput. Oper. Res. 38(8): 1109-1116 (2011) - 2010
- [j7]Maria Albareda-Sambola, Juan A. Díaz, Elena Fernández:
Lagrangean duals and exact solution to the capacitated p-center problem. Eur. J. Oper. Res. 201(1): 71-81 (2010)
2000 – 2009
- 2009
- [j6]Maria Albareda-Sambola, Antonio Alonso-Ayuso, Elisenda Molina, Clara Simón de Blas:
Variable Neighborhood Search for Order Batching in a Warehouse. Asia Pac. J. Oper. Res. 26(5): 655-683 (2009) - [j5]Maria Albareda-Sambola, Elena Fernández, Gilbert Laporte:
The capacity and distance constrained plant location problem. Comput. Oper. Res. 36(2): 597-611 (2009) - [j4]Maria Albareda-Sambola, Elena Fernández, Yolanda Hinojosa, Justo Puerto:
The multi-period incremental service facility location problem. Comput. Oper. Res. 36(5): 1356-1375 (2009) - 2007
- [j3]Maria Albareda-Sambola, Elena Fernández, Gilbert Laporte:
Heuristic and lower bound for a stochastic location-routing problem. Eur. J. Oper. Res. 179(3): 940-955 (2007) - 2006
- [j2]Maria Albareda-Sambola, Maarten H. van der Vlerk, Elena Fernández:
Exact solutions to a class of stochastic generalized assignment problems. Eur. J. Oper. Res. 173(2): 465-487 (2006) - 2005
- [j1]Maria Albareda-Sambola, Juan A. Díaz, Elena Fernández:
A compact model and tight bounds for a combined location-routing problem. Comput. Oper. Res. 32: 407-428 (2005)
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-11-04 21:40 CET 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:
