default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJosé Fernández 0001
- > Home > Persons > José Fernández 0001
Publications
- 2019
[j23]José Fernández
, Boglárka G.-Tóth, Juana López Redondo, Pilar M. Ortigosa:
The probabilistic customer's choice rule with a threshold attraction value: Effect on the location of competitive facilities in the plane. Comput. Oper. Res. 101: 234-249 (2019)- [c3]Boglárka G.-Tóth, Laura Anton-Sanchez, José Fernández, Juana López Redondo, Pilar M. Ortigosa:
A Continuous Competitive Facility Location and Design Problem for Firm Expansion. WCGO 2019: 1013-1022 - 2017
- [j22]José Fernández, Boglárka G.-Tóth, Juana López Redondo, Pilar M. Ortigosa, Aránzazu Gila Arrondo:
A planar single-facility competitive location and design problem under the multi-deterministic choice rule. Comput. Oper. Res. 78: 305-315 (2017) - [j21]Juana López Redondo, José Fernández, Pilar Martínez Ortigosa:
FEMOEA: a fast and efficient multi-objective evolutionary algorithm. Math. Methods Oper. Res. 85(1): 113-135 (2017) - 2015
- [j20]Aránzazu Gila Arrondo, Juana López Redondo, José Fernández, Pilar Martínez Ortigosa:
Parallelization of a non-linear multi-objective optimization algorithm: Application to a location problem. Appl. Math. Comput. 255: 114-124 (2015) - [j19]Juana López Redondo, José Fernández, José Domingo Álvarez Hervás, Aránzazu Gila Arrondo, Pilar Martínez Ortigosa:
Approximating the Pareto-front of a planar bi-objective competitive facility location and design problem. Comput. Oper. Res. 62: 337-349 (2015) - 2014
- [j17]A. G. Arrondo, José Fernández, Juana López Redondo, Pilar Martínez Ortigosa:
An approach for solving competitive location problems with variable demand using multicore systems. Optim. Lett. 8(2): 555-567 (2014) - [j16]A. G. Arrondo, Juana López Redondo, José Fernández, Pilar Martínez Ortigosa:
Solving a leader-follower facility problem via parallel evolutionary approaches. J. Supercomput. 70(2): 600-611 (2014) - 2013
- [j14]Juana López Redondo, A. G. Arrondo, José Fernández, Inmaculada García, Pilar Martínez Ortigosa:
A two-level evolutionary algorithm for solving the facility location and design (1|1)-centroid problem on the plane with variable demand. J. Glob. Optim. 56(3): 983-1005 (2013) - [c2]A. G. Arrondo, Juana López Redondo, José Fernández, Pilar M. Ortigosa:
Solving a Continuous (1 I 1)-Centroid Problem with Endogenous Demand: High Performance Approaches. 3PGCIC 2013: 519-524 - 2012
- [c1]Juana López Redondo, José Fernández, José Domingo Álvarez, A. G. Arrondo, Pilar Martínez Ortigosa:
Approximating the Pareto-front of Continuous Bi-objective Problems: Application to a Competitive Facility Location Problem. IS-MiS 2012: 207-216 - 2008
- [j8]Juana López Redondo, José Fernández, Inmaculada García, Pilar Martínez Ortigosa:
Parallel algorithms for continuous competitive location problems. Optim. Methods Softw. 23(5): 779-791 (2008)
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-08-03 21:19 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:
