default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBlas Pelegrín
Person information
- affiliation: Universidad de Murcia, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j34]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)- [j33]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
- [j32]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
- [j31]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
- [j30]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) - [j29]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
- [j28]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) - [j27]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) - [j26]Mercedes Pelegrín, Blas Pelegrín:
Nash equilibria in location games on a network. OR Spectr. 39(3): 775-791 (2017) - 2016
- [j25]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) - [j24]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
- [j23]M. Elena Sáiz, Eligius M. T. Hendrix, Blas Pelegrín:
On Nash equilibria of a competitive location-design problem. Eur. J. Oper. Res. 210(3): 588-593 (2011) - [j22]José Miguel Díaz-Báñez, Marco A. Heredia, Blas Pelegrín, Pablo Pérez-Lantero, Inmaculada Ventura:
Finding all pure strategy Nash equilibria in a planar location game. Eur. J. Oper. Res. 214(1): 91-98 (2011) - [j21]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) - [j20]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
- 2009
- [j19]Juan A. Mesa, Blas Pelegrín, Justo Puerto:
Selected papers presented at the tenth International Symposium on Locational Decisions (ISOLDE X). Comput. Oper. Res. 36(5): 1333-1334 (2009) - [j18]Boglárka Tóth, José Fernández, Blas Pelegrín, Frank Plastria:
Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models. Comput. Oper. Res. 36(5): 1393-1405 (2009) - [j17]Boglárka Tóth, Frank Plastria, José Fernández, Blas Pelegrín:
On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems. OR Spectr. 31(3): 601-627 (2009) - [j16]M. Elena Sáiz, Eligius M. T. Hendrix, José Fernández, Blas Pelegrín:
On a branch-and-bound approach for a Huff-like Stackelberg location problem. OR Spectr. 31(3): 679-705 (2009) - 2008
- [j15]S. Arifusalem, Stefano Benati, Brian Boffey, Teresa Cáceres, Dietmar Cieslik, Zvi Drezner, Horst A. Eiselt, Ioannis Giannikos, Horst W. Hamacher, John M. Hodgson, Jörg Kalcsics, Kathrin Klamroth, Olivier Klopfenstein, Mercedes Landete, Maria Cruz López de los Mozos Martin, Alfredo Marín, Juan A. Mesa, Malick M. Ndiaye, Stefan Nickel, Blas Pelegrín:
New trends in locational analysis. Comput. Oper. Res. 35(3): 649-650 (2008) - [j14]Blas Pelegrín, José Fernández, Boglárka Tóth:
The 1-center problem in the plane with independent random weights. Comput. Oper. Res. 35(3): 737-749 (2008) - 2007
- [j13]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) - [j12]José Fernández, Blas Pelegrín, Frank Plastria, Boglárka Tóth:
Solving a Huff-like competitive location and design model for profit maximization in the plane. Eur. J. Oper. Res. 179(3): 1274-1287 (2007) - [j11]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 - 2003
- [j10]María Dolores García Pérez, Blas Pelegrín:
All Stackelberg Location Equilibria in the Hotelling's Duopoly Model on a Tree with Parametric Prices. Ann. Oper. Res. 122(1-4): 177-192 (2003) - 2002
- [j9]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) - [j8]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) - 2001
- [j7]José Fernández, Blas Pelegrín:
Using Interval Analysis for Solving Planar Single-Facility Location Problems: New Discarding Tests. J. Glob. Optim. 19(1): 61-81 (2001) - 2000
- [j6]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) - [j5]José Fernández, Lázaro Cánovas, Blas Pelegrín:
Algorithms for the decomposition of a polygon into convex polygons. Eur. J. Oper. Res. 121(2): 330-342 (2000)
1990 – 1999
- 1999
- [j4]Alfredo Marín, Blas Pelegrín:
Applying Lagrangian relaxation to the resolution of two-stage location problems. Ann. Oper. Res. 86: 179-198 (1999) - 1998
- [j3]Blas Pelegrín, Lázaro Cánovas:
The Minimum Covering lpb-Hypersphere Problem. Comput. Optim. Appl. 9(1): 85-97 (1998) - [j2]Blas Pelegrín, Pascual Fernández:
On the sum-max bicriterion path problem. Comput. Oper. Res. 25(12): 1043-1054 (1998) - 1997
- [j1]Alfredo Marín, Blas Pelegrín:
A branch-and-bound algorithm for the transportation problem with location of p transshipment points. Comput. Oper. Res. 24(7): 659-678 (1997)
Coauthor Index
aka: Pascual Fernández-Hernández
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:20 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:
