Blas Pelegrín

39 papers Journal 35Unranked 3
YearRankTypeTitle / Venue / Authors
2025 J jnl
Population-based algorithm for discrete facility location with ranking of candidate locations.
J. Comput. Appl. Math.
Algirdas Lancinskas, Julius Zilinskas, Pascual Fernández, Blas Pelegrín
2024 J jnl
Pareto efficiency as alternative to Nash equilibrium in competitive discrete location under delivered pricing.
J. Oper. Res. Soc.
Blas Pelegrín, Pascual Fernández, María Dolores García Pérez
2024 J jnl
Sequential customers' decisions in facility location with comparison-shopping.
Comput. Oper. Res.
Gonzalo Méndez-Vogel, Vladimir Marianov, Pascual Fernández, Blas Pelegrín, Armin Lüer-Villagra
2023 J jnl
A discrete competitive facility location model with proportional and binary rules sequentially applied.
Optim. Lett.
Pascual Fernández, Algirdas Lancinskas, Blas Pelegrín, Julius Zilinskas
2021 J jnl
Exact and heuristic solutions of a discrete competitive location model with Pareto-Huff customer choice rule.
J. Comput. Appl. Math.
Pascual Fernández, Blas Pelegrín, Algirdas Lancinskas, Julius Zilinskas
2020 J jnl
A Discrete Competitive Facility Location Model with Minimal Market Share Constraints and Equity-Based Ties Breaking Rule.
Informatica
Pascual Fernández, Algirdas Lancinskas, Blas Pelegrín, Julius Zilinskas
2020 J jnl
Solution of asymmetric discrete competitive facility location problems using ranking of candidate locations.
Soft Comput.
Algirdas Lancinskas, Julius Zilinskas, Pascual Fernández, Blas Pelegrín
2019 — conf
Ranking-based discrete optimization algorithm for asymmetric competitive facility location.
GECCO (Companion)
Algirdas Lancinskas, Julius Zilinskas, Pascual Fernández, Blas Pelegrín
2018 — conf
The Huff Versus the Pareto-Huff Customer Choice Rules in a Discrete Competitive Location Model.
ICCSA (2)
Pascual Fernández, Blas Pelegrín, Algirdas Lancinskas, Julius Zilinskas
2017 J jnl
Improving solution of discrete competitive facility location problems.
Optim. Lett.
Algirdas Lancinskas, Pascual Fernández, Blas Pelegrín, Julius Zilinskas
2017 J jnl
Nash equilibria in location games on a network.
OR Spectr.
Mercedes Pelegrín, Blas Pelegrín
2017 J jnl
New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior.
Comput. Oper. Res.
Pascual Fernández, Blas Pelegrín, Algirdas Lancinskas, Julius Zilinskas
2016 — ch.
Estimating the Pareto Front of a Hard Bi-criterion Competitive Facility Location Problem.
Advances in Stochastic and Deterministic Global Optimization
Algirdas Lancinskas, Pascual Fernández, Blas Pelegrín, Julius Zilinskas
2016 J jnl
Profit maximization and reduction of the cannibalization effect in chain expansion.
Ann. Oper. Res.
Blas Pelegrín, Pascual Fernández, María Dolores García Pérez
2016 J jnl
Solution of Discrete Competitive Facility Location Problem for Firm Expansion.
Informatica
Algirdas Lancinskas, Pascual Fernández, Blas Pelegrín, Julius Zilinskas
2011 J jnl
Finding all pure strategy Nash equilibria in a planar location game.
Eur. J. Oper. Res.
José Miguel Díaz-Báñez, Marco A. Heredia, Blas Pelegrín, Pablo Pérez-Lantero, Inmaculada Ventura
2011 J jnl
Finding location equilibria for competing firms under delivered pricing.
J. Oper. Res. Soc.
Blas Pelegrín, Pablo Dorta-González, Pascual Fernández-Hernández
2011 J jnl
Finding multiple global optima for unconstrained discrete location problems.
Optim. Methods Softw.
Juana López Redondo, Blas Pelegrín, Pascual Fernández, Inmaculada García, Pilar Martínez Ortigosa
2011 J jnl
On Nash equilibria of a competitive location-design problem.
Eur. J. Oper. Res.
M. Elena Sáiz, Eligius M. T. Hendrix, Blas Pelegrín
2009 J jnl
On a branch-and-bound approach for a Huff-like Stackelberg location problem.
OR Spectr.
M. Elena Sáiz, Eligius M. T. Hendrix, José Fernández, Blas Pelegrín
2009 J jnl
On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems.
OR Spectr.
Boglárka Tóth, Frank Plastria, José Fernández, Blas Pelegrín
2009 J jnl
Selected papers presented at the tenth International Symposium on Locational Decisions (ISOLDE X).
Comput. Oper. Res.
Juan A. Mesa, Blas Pelegrín, Justo Puerto
2009 J jnl
Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models.
Comput. Oper. Res.
Boglárka Tóth, José Fernández, Blas Pelegrín, Frank Plastria
2008 J jnl
New trends in locational analysis.
Comput. Oper. Res.
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
2008 J jnl
The 1-center problem in the plane with independent random weights.
Comput. Oper. Res.
Blas Pelegrín, José Fernández, Boglárka Tóth
2007 J jnl
A discrete long-term location-price problem under the assumption of discriminatory pricing: Formulations and parametric analysis.
Eur. J. Oper. Res.
Pascual Fernández, Blas Pelegrín, María Dolores García Pérez, Peter H. Peeters
2007 J jnl
GASUB: finding global optima to discrete location problems by a genetic-like algorithm.
J. Glob. Optim.
Blas Pelegrín, Juana López Redondo, Pascual Fernández, Inmaculada García, Pilar Martínez Ortigosa
2007 J jnl
Solving a Huff-like competitive location and design model for profit maximization in the plane.
Eur. J. Oper. Res.
José Fernández, Blas Pelegrín, Frank Plastria, Boglárka Tóth
2005 — conf
Parallelization of an Algorithm for Finding Facility Locations for an Entering Firm Under Delivered Pricing.
PARCO
Juana López Redondo, Inmaculada García, Pilar Martínez Ortigosa, Blas Pelegrín, Pascual Fernández
2003 J jnl
All Stackelberg Location Equilibria in the Hotelling's Duopoly Model on a Tree with Parametric Prices.
Ann. Oper. Res.
María Dolores García Pérez, Blas Pelegrín
2002 J jnl
Estimating actual distances by norm functions: a comparison between the
Comput. Oper. Res.
José Fernández, Pascual Fernández, Blas Pelegrín
2002 J jnl
The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets.
RAIRO Oper. Res.
T. Brian Boffey, R. C. Williams, Blas Pelegrín, Pascual Fernández
2001 J jnl
Using Interval Analysis for Solving Planar Single-Facility Location Problems: New Discarding Tests.
J. Glob. Optim.
José Fernández, Blas Pelegrín
2000 J jnl
A continuous location model for siting a non-noxious undesirable facility within a geographical region.
Eur. J. Oper. Res.
José Fernández, Pascual Fernández, Blas Pelegrín
2000 J jnl
Algorithms for the decomposition of a polygon into convex polygons.
Eur. J. Oper. Res.
José Fernández, Lázaro Cánovas, Blas Pelegrín
1999 J jnl
Applying Lagrangian relaxation to the resolution of two-stage location problems.
Ann. Oper. Res.
Alfredo Marín, Blas Pelegrín
1998 J jnl
On the sum-max bicriterion path problem.
Comput. Oper. Res.
Blas Pelegrín, Pascual Fernández
1998 J jnl
The Minimum Covering
Comput. Optim. Appl.
Blas Pelegrín, Lázaro Cánovas
1997 J jnl
A branch-and-bound algorithm for the transportation problem with location of
Comput. Oper. Res.
Alfredo Marín, Blas Pelegrín