Pascual Fernández

22 papers Journal 18Unranked 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
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 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
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
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
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
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
1998 J jnl
On the sum-max bicriterion path problem.
Comput. Oper. Res.
Blas Pelegrín, Pascual Fernández