Blas Pelegrín

According to our database, Blas Pelegrín authored at least 37 papers between 1997 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Sequential customers' decisions in facility location with comparison-shopping.

Gonzalo Méndez-Vogel, Vladimir Marianov, Pascual Fernández, Blas Pelegrín, Armin Lüer-Villagra

Comput. Oper. Res., January, 2024

2023

A discrete competitive facility location model with proportional and binary rules sequentially applied.

Pascual Fernández, Algirdas Lancinskas, Blas Pelegrín, Julius Zilinskas

Optim. Lett., May, 2023

2021

Exact and heuristic solutions of a discrete competitive location model with Pareto-Huff customer choice rule.

Pascual Fernández, Blas Pelegrín, Algirdas Lancinskas, Julius Zilinskas

J. Comput. Appl. Math., 2021

2020

Solution of asymmetric discrete competitive facility location problems using ranking of candidate locations.

Algirdas Lancinskas, Julius Zilinskas, Pascual Fernández, Blas Pelegrín

Soft Comput., 2020

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

Pascual Fernández, Algirdas Lancinskas, Blas Pelegrín, Julius Zilinskas

Informatica, 2020

2019

Ranking-based discrete optimization algorithm for asymmetric competitive facility location.

Algirdas Lancinskas, Julius Zilinskas, Pascual Fernández, Blas Pelegrín

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.

Pascual Fernández, Blas Pelegrín, Algirdas Lancinskas, Julius Zilinskas

Proceedings of the Computational Science and Its Applications - ICCSA 2018, 2018

2017

Nash equilibria in location games on a network.

Mercedes Pelegrín, Blas Pelegrín

OR Spectr., 2017

Improving solution of discrete competitive facility location problems.

Algirdas Lancinskas, Pascual Fernández, Blas Pelegrín, Julius Zilinskas

Optim. Lett., 2017

New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior.

Pascual Fernández, Blas Pelegrín, Algirdas Lancinskas, Julius Zilinskas

Comput. Oper. Res., 2017

2016

Solution of Discrete Competitive Facility Location Problem for Firm Expansion.

Algirdas Lancinskas, Pascual Fernández, Blas Pelegrín, Julius Zilinskas

Informatica, 2016

Profit maximization and reduction of the cannibalization effect in chain expansion.

Blas Pelegrín, Pascual Fernández, María Dolores García Pérez

Ann. Oper. Res., 2016

Estimating the Pareto Front of a Hard Bi-criterion Competitive Facility Location Problem.

Algirdas Lancinskas, Pascual Fernández, Blas Pelegrín, Julius Zilinskas

Proceedings of the Advances in Stochastic and Deterministic Global Optimization., 2016

2011

Finding multiple global optima for unconstrained discrete location problems.

Juana López Redondo, Blas Pelegrín, Pascual Fernández, Inmaculada García, Pilar Martínez Ortigosa

Optim. Methods Softw., 2011

Finding location equilibria for competing firms under delivered pricing.

Blas Pelegrín, Pablo Dorta-González, Pascual Fernández-Hernández

J. Oper. Res. Soc., 2011

On Nash equilibria of a competitive location-design problem.

M. Elena Sáiz, Eligius M. T. Hendrix, Blas Pelegrín

Eur. J. Oper. Res., 2011

Finding all pure strategy Nash equilibria in a planar location game.

José Miguel Díaz-Báñez, Marco A. Heredia, Blas Pelegrín, Pablo Pérez-Lantero, Inmaculada Ventura

Eur. J. Oper. Res., 2011

2009

On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems.

Boglárka Tóth, Frank Plastria, José Fernández, Blas Pelegrín

OR Spectr., 2009

On a branch-and-bound approach for a Huff-like Stackelberg location problem.

M. Elena Sáiz, Eligius M. T. Hendrix, José Fernández, Blas Pelegrín

OR Spectr., 2009

Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models.

Boglárka Tóth, José Fernández, Blas Pelegrín, Frank Plastria

Comput. Oper. Res., 2009

Selected papers presented at the tenth International Symposium on Locational Decisions (ISOLDE X).

Juan A. Mesa, Blas Pelegrín, Justo Puerto

Comput. Oper. Res., 2009

2008

The 1-center problem in the plane with independent random weights.

Blas Pelegrín, José Fernández, Boglárka Tóth

Comput. Oper. Res., 2008

New trends in locational analysis.

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

Comput. Oper. Res., 2008

2007

GASUB: finding global optima to discrete location problems by a genetic-like algorithm.

Blas Pelegrín, Juana López Redondo, Pascual Fernández, Inmaculada García, Pilar Martínez Ortigosa

J. Glob. Optim., 2007

Solving a Huff-like competitive location and design model for profit maximization in the plane.

José Fernández, Blas Pelegrín, Frank Plastria, Boglárka Tóth

Eur. J. Oper. Res., 2007

A discrete long-term location-price problem under the assumption of discriminatory pricing: Formulations and parametric analysis.

Pascual Fernández, Blas Pelegrín, María Dolores García Pérez, Peter H. Peeters

Eur. J. Oper. Res., 2007

2005

Parallelization of an Algorithm for Finding Facility Locations for an Entering Firm Under Delivered Pricing.

Juana López Redondo, Inmaculada García, Pilar Martínez Ortigosa, Blas Pelegrín, Pascual Fernández

Proceedings of the Parallel Computing: Current & Future Issues of High-End Computing, 2005

2003

All Stackelberg Location Equilibria in the Hotelling's Duopoly Model on a Tree with Parametric Prices.

María Dolores García Pérez, Blas Pelegrín

Ann. Oper. Res., 2003

2002

The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets.

T. Brian Boffey, R. C. Williams, Blas Pelegrín, Pascual Fernández

RAIRO Oper. Res., 2002

Estimating actual distances by norm functions: a comparison between the <i>l</i>_{<i>k</i>, <i>p</i>, theta}-norm and the <i>l</i>_{<i>b</i>₁, <i>b</i>₂, theta}-norm and a study about the selection of the data set.

José Fernández, Pascual Fernández, Blas Pelegrín

Comput. Oper. Res., 2002

2001

Using Interval Analysis for Solving Planar Single-Facility Location Problems: New Discarding Tests.

José Fernández, Blas Pelegrín

J. Glob. Optim., 2001

2000

A continuous location model for siting a non-noxious undesirable facility within a geographical region.

José Fernández, Pascual Fernández, Blas Pelegrín

Eur. J. Oper. Res., 2000

Algorithms for the decomposition of a polygon into convex polygons.

José Fernández, Lázaro Cánovas, Blas Pelegrín

Eur. J. Oper. Res., 2000

1999

Applying Lagrangian relaxation to the resolution of two-stage location problems.

Alfredo Marín, Blas Pelegrín

Ann. Oper. Res., 1999

1998

On the sum-max bicriterion path problem.

Blas Pelegrín, Pascual Fernández

Comput. Oper. Res., 1998

The Minimum Covering <i>l</i>_<i>pb</i>-Hypersphere Problem.

Blas Pelegrín, Lázaro Cánovas

Comput. Optim. Appl., 1998

1997

A branch-and-bound algorithm for the transportation problem with location of <i>p</i> transshipment points.

Alfredo Marín, Blas Pelegrín

Comput. Oper. Res., 1997