Pascual Fernández

Orcid: 0000-0001-9194-4610

According to our database1, Pascual Fernández authored at least 23 papers between 1998 and 2025.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Population-based algorithm for discrete facility location with ranking of candidate locations.
J. Comput. Appl. Math., 2025

2024
Pareto efficiency as alternative to Nash equilibrium in competitive discrete location under delivered pricing.
J. Oper. Res. Soc., April, 2024

Sequential customers' decisions in facility location with comparison-shopping.
Comput. Oper. Res., January, 2024

2023
A discrete competitive facility location model with proportional and binary rules sequentially applied.
Optim. Lett., May, 2023

2021
Exact and heuristic solutions of a discrete competitive location model with Pareto-Huff customer choice rule.
J. Comput. Appl. Math., 2021

2020
Solution of asymmetric discrete competitive facility location problems using ranking of candidate locations.
Soft Comput., 2020

A Discrete Competitive Facility Location Model with Minimal Market Share Constraints and Equity-Based Ties Breaking Rule.
Informatica, 2020

2019
Ranking-based discrete optimization algorithm for asymmetric competitive facility location.
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019

2018
The Huff Versus the Pareto-Huff Customer Choice Rules in a Discrete Competitive Location Model.
Proceedings of the Computational Science and Its Applications - ICCSA 2018, 2018

2017
Improving solution of discrete competitive facility location problems.
Optim. Lett., 2017

New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior.
Comput. Oper. Res., 2017

2016
Solution of Discrete Competitive Facility Location Problem for Firm Expansion.
Informatica, 2016

Profit maximization and reduction of the cannibalization effect in chain expansion.
Ann. Oper. Res., 2016

Estimating the Pareto Front of a Hard Bi-criterion Competitive Facility Location Problem.
Proceedings of the Advances in Stochastic and Deterministic Global Optimization., 2016

2011
Finding multiple global optima for unconstrained discrete location problems.
Optim. Methods Softw., 2011

Finding location equilibria for competing firms under delivered pricing.
J. Oper. Res. Soc., 2011

2007
GASUB: finding global optima to discrete location problems by a genetic-like algorithm.
J. Glob. Optim., 2007

A discrete long-term location-price problem under the assumption of discriminatory pricing: Formulations and parametric analysis.
Eur. J. Oper. Res., 2007

2005
Parallelization of an Algorithm for Finding Facility Locations for an Entering Firm Under Delivered Pricing.
Proceedings of the Parallel Computing: Current & Future Issues of High-End Computing, 2005

2002
The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets.
RAIRO Oper. Res., 2002

Estimating actual distances by norm functions: a comparison between the <i>l</i><sub><i>k</i>, <i>p</i>, theta</sub>-norm and the <i>l</i><sub><i>b</i><sub>1</sub>, <i>b</i><sub>2</sub>, theta</sub>-norm and a study about the selection of the data set.
Comput. Oper. Res., 2002

2000
A continuous location model for siting a non-noxious undesirable facility within a geographical region.
Eur. J. Oper. Res., 2000

1998
On the sum-max bicriterion path problem.
Comput. Oper. Res., 1998


  Loading...