![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Pascual Fernández
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j18]Gonzalo Méndez-Vogel
, Vladimir Marianov, Pascual Fernández
, Blas Pelegrín, Armin Lüer-Villagra
:
Sequential customers' decisions in facility location with comparison-shopping. Comput. Oper. Res. 161: 106448 (2024) - [j17]Blas Pelegrín, Pascual Fernández
, María Dolores García Pérez:
Pareto efficiency as alternative to Nash equilibrium in competitive discrete location under delivered pricing. J. Oper. Res. Soc. 75(4): 731-741 (2024) - 2023
- [j16]Pascual Fernández
, Algirdas Lancinskas
, Blas Pelegrín, Julius Zilinskas:
A discrete competitive facility location model with proportional and binary rules sequentially applied. Optim. Lett. 17(4): 867-877 (2023) - 2021
- [j15]Pascual Fernández
, Blas Pelegrín, Algirdas Lancinskas
, Julius Zilinskas:
Exact and heuristic solutions of a discrete competitive location model with Pareto-Huff customer choice rule. J. Comput. Appl. Math. 385: 113200 (2021) - 2020
- [j14]Pascual Fernández
, Algirdas Lancinskas
, Blas Pelegrín, Julius Zilinskas:
A Discrete Competitive Facility Location Model with Minimal Market Share Constraints and Equity-Based Ties Breaking Rule. Informatica 31(2): 205-224 (2020) - [j13]Algirdas Lancinskas
, Julius Zilinskas, Pascual Fernández
, Blas Pelegrín:
Solution of asymmetric discrete competitive facility location problems using ranking of candidate locations. Soft Comput. 24(23): 17705-17713 (2020)
2010 – 2019
- 2019
- [c3]Algirdas Lancinskas
, Julius Zilinskas, Pascual Fernández
, Blas Pelegrín:
Ranking-based discrete optimization algorithm for asymmetric competitive facility location. GECCO (Companion) 2019: 149-150 - 2018
- [c2]Pascual Fernández
, Blas Pelegrín, Algirdas Lancinskas
, Julius Zilinskas:
The Huff Versus the Pareto-Huff Customer Choice Rules in a Discrete Competitive Location Model. ICCSA (2) 2018: 583-592 - 2017
- [j12]Pascual Fernández
, Blas Pelegrín, Algirdas Lancinskas
, Julius Zilinskas:
New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior. Comput. Oper. Res. 79: 12-18 (2017) - [j11]Algirdas Lancinskas
, Pascual Fernández
, Blas Pelegrín, Julius Zilinskas:
Improving solution of discrete competitive facility location problems. Optim. Lett. 11(2): 259-270 (2017) - 2016
- [j10]Blas Pelegrín, Pascual Fernández
, María Dolores García Pérez:
Profit maximization and reduction of the cannibalization effect in chain expansion. Ann. Oper. Res. 246(1-2): 57-75 (2016) - [j9]Algirdas Lancinskas, Pascual Fernández, Blas Pelegrín, Julius Zilinskas:
Solution of Discrete Competitive Facility Location Problem for Firm Expansion. Informatica 27(2): 451-462 (2016) - [p1]Algirdas Lancinskas
, Pascual Fernández
, Blas Pelegrín, Julius Zilinskas:
Estimating the Pareto Front of a Hard Bi-criterion Competitive Facility Location Problem. Advances in Stochastic and Deterministic Global Optimization 2016: 255-272 - 2011
- [j8]Blas Pelegrín, Pablo Dorta-González
, Pascual Fernández-Hernández
:
Finding location equilibria for competing firms under delivered pricing. J. Oper. Res. Soc. 62(4): 729-741 (2011) - [j7]Juana López Redondo
, Blas Pelegrín, Pascual Fernández
, Inmaculada García
, Pilar Martínez Ortigosa
:
Finding multiple global optima for unconstrained discrete location problems. Optim. Methods Softw. 26(2): 207-224 (2011)
2000 – 2009
- 2007
- [j6]Pascual Fernández
, Blas Pelegrín, María Dolores García Pérez, Peter H. Peeters:
A discrete long-term location-price problem under the assumption of discriminatory pricing: Formulations and parametric analysis. Eur. J. Oper. Res. 179(3): 1050-1062 (2007) - [j5]Blas Pelegrín, Juana López Redondo
, Pascual Fernández
, Inmaculada García
, Pilar Martínez Ortigosa
:
GASUB: finding global optima to discrete location problems by a genetic-like algorithm. J. Glob. Optim. 38(2): 249-264 (2007) - 2005
- [c1]Juana López Redondo, Inmaculada García, Pilar Martínez Ortigosa, Blas Pelegrín, Pascual Fernández:
Parallelization of an Algorithm for Finding Facility Locations for an Entering Firm Under Delivered Pricing. PARCO 2005: 269-276 - 2002
- [j4]José Fernández
, Pascual Fernández
, Blas Pelegrín:
Estimating actual distances by norm functions: a comparison between the lk, p, theta-norm and the lb1, b2, theta-norm and a study about the selection of the data set. Comput. Oper. Res. 29(6): 609-623 (2002) - [j3]T. Brian Boffey, R. C. Williams, Blas Pelegrín, Pascual Fernández
:
The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets. RAIRO Oper. Res. 36(1): 1-19 (2002) - 2000
- [j2]José Fernández
, Pascual Fernández
, Blas Pelegrín:
A continuous location model for siting a non-noxious undesirable facility within a geographical region. Eur. J. Oper. Res. 121(2): 259-274 (2000)
1990 – 1999
- 1998
- [j1]Blas Pelegrín, Pascual Fernández
:
On the sum-max bicriterion path problem. Comput. Oper. Res. 25(12): 1043-1054 (1998)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-05 20:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint