Pascual Fernández

Publication Activity (10 Years)

Years Active: 1998-2024
Publications (10 Years): 12

Top Topics

Optimization Algorithm

Integer Programming

Facility Location

Profit Maximization

Top Venues

Comput. Oper. Res.

GECCO (Companion)

Publications

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) (2024)
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 (2024)
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) (2023)
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 (2021)
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) (2020)
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) (2020)
Algirdas Lancinskas, Julius Zilinskas, Pascual Fernández, Blas Pelegrín
Ranking-based discrete optimization algorithm for asymmetric competitive facility location. GECCO (Companion) (2019)
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)
Algirdas Lancinskas, Pascual Fernández, Blas Pelegrín, Julius Zilinskas
Improving solution of discrete competitive facility location problems. Optim. Lett. 11 (2) (2017)
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 (2017)
Algirdas Lancinskas, Pascual Fernández, Blas Pelegrín, Julius Zilinskas
Solution of Discrete Competitive Facility Location Problem for Firm Expansion. Informatica 27 (2) (2016)
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) (2016)
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) (2011)
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) (2007)
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) (2007)
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)
José Fernández, Pascual Fernández, Blas Pelegrín
-norm and a study about the selection of the data set. Comput. Oper. Res. 29 (6) (2002)
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) (2002)
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) (2000)
Blas Pelegrín, Pascual Fernández
On the sum-max bicriterion path problem. Comput. Oper. Res. 25 (12) (1998)