Pelegrín Pelegrín, Blas Author

Cooperative Location for Competing Firms under Delivered Pricing and Demand Linear in Price

  • Pelegrín B.
  • Fernández P.
  • García M.D.

Networks and Spatial Economics - 1/1/2024

10.1007/s11067-024-09629-z

Cite count:

Pareto efficiency as alternative to Nash equilibrium in competitive discrete location under delivered pricing

  • Pelegrín B.
  • Fernández P.
  • García M.D.

Journal of the Operational Research Society - 1/1/2024

10.1080/01605682.2023.2204908

Cite count: 1 (Scopus)

Sequential customers’ decisions in facility location with comparison-shopping

  • Méndez-Vogel G.
  • Marianov V.
  • Fernández P.
  • Pelegrín B.
  • Lüer-Villagra A.

Computers and Operations Research - 1/1/2024

10.1016/j.cor.2023.106448

Cite count: 2 (Scopus)

On the Existence and Computation of Nash Equilibrium in Network Competitive Location Under Delivered Pricing and Price Sensitive Demand

  • Pelegrín B.
  • Fernández P.
  • García M.D.

NETWORKS and SPATIAL ECONOMICS - 1/1/2023

10.1007/s11067-023-09598-9

Cite count:

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

  • Fernández P.
  • Lančinskas A.
  • Pelegrín B.
  • Žilinskas J.

Optimization Letters - 1/1/2022

10.1007/s11590-022-01938-x

Cite count:
Open Access

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

  • Fernández P.
  • Pelegrín B.
  • Lančinskas A.
  • Žilinskas J.

JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS - 15/3/2021

10.1016/j.cam.2020.113200

Cite count: 11 (Web of Science) 1 (Scopus)

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

  • Lančinskas A.
  • Žilinskas J.
  • Fernández P.
  • Pelegrín B.

SOFT COMPUTING - 1/1/2020

10.1007/s00500-020-05106-0

Cite count: 3 (Web of Science) 2 (Scopus)

Exact equilibrium quantities in spatially separated markets under production constraints

  • Pérez M.D.G.
  • Pelegrín B.P.

Journal of Interdisciplinary Mathematics - 1/1/2020

10.1080/09720502.2020.1741220

Cite count:
Open Access

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

  • Fernández P.
  • Lančinskas A.
  • Pelegrín B.
  • Zilinskas J.

INFORMATICA - 1/1/2020

10.15388/20-infor410

Cite count: 6 (Web of Science) 3 (Scopus)

Threshold distance versus side payment to reduce the cannibalization effect in retail chain expansion

  • Pelegrin, Blas
  • Fernandez, Pascual
  • Diego Pelegrin, Juan
  • Dolores Garcia, Maria

IMA Journal of Management Mathematics - 1/01/2019

10.1093/imaman/dpx011

Cite count: 2 (Web of Science) 1 (Scopus)

Discrete Competitive Facility Location by Ranking Candidate Locations

  • Lan?inskas A.
  • Fernández P.
  • Pelegrín B.
  • Žilinskas J.

Studies in Computational Intelligence - 1/1/2020

10.1007/978-3-030-39250-5_8

Cite count:
Open Access

Nash Equilibria in Network Facility Location Under Delivered Prices

  • Pelegrin, Blas
  • Fernandez, Pascual
  • Garcia, Maria D.
  • Mallozzi, L
  • DAmato, E
  • Pardalos, PM

SPATIAL INTERACTION MODELS: FACILITY LOCATION USING GAME THEORY - 1/1/2017

10.1007/978-3-319-52654-6_13

Cite count: 3 (Web of Science) 1 (Scopus)

Reconciling franchisor and franchisee: A planar biobjective competitive location and design model

  • Fernández J.
  • Tóth B.
  • Plastria F.
  • Pelegrín B.

Lecture Notes in Economics and Mathematical Systems - 1/12/2006

10.1007/3-540-28258-0_22

Cite count: 12 (Scopus)

Ranking-based discrete optimization algorithm for asymmetric competitive facility location

  • Lan?inskas A.
  • Žilinskas J.
  • Fernández P.
  • Pelegrín B.

GECCO 2019 Companion - Proceedings of the 2019 Genetic and Evolutionary Computation Conference Companion - 13/7/2019

10.1145/3319619.3321893

Cite count:

Ranking-based algorithm for facility location with constraints

  • Lan?inskas A.
  • Fernández P.
  • Pelegrín B.
  • Žilinskas J.

AIP Conference Proceedings - 12/2/2019

10.1063/1.5089997

Cite count:
Open Access

The huff versus the pareto-huff customer choice rules in a discrete competitive location model

  • Fernández P.
  • Pelegrín B.
  • Lan?inskas A.
  • Žilinskas J.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) - 1/1/2018

10.1007/978-3-319-95165-2_41

Cite count:

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

  • Marin, A
  • Pelegrin, B

ANNALS OF OPERATIONS RESEARCH - 1/1/1999

10.1023/a:1018998500803

Cite count: 32 (Web of Science) 40 (Scopus)

The return plant location problem: Modelling and resolution

  • Marin, A
  • Pelegrin, B

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH - 16/01/1998

10.1016/s0377-2217(97)00192-6

Cite count: 65 (Web of Science) 90 (Scopus)

A new assignment rule to improve seed points algorithms for the continuous k-center problem

  • Pelegrin, B
  • Canovas, L

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH - 16/01/1998

10.1016/s0377-2217(97)00191-4

Cite count: 6 (Web of Science) 7 (Scopus)

This author has no patents.

This author has no reports or other types of publications.

Scopus: 16

Web of Science: 17

Scopus: 23

Web of Science: 24

Last data update: 11/2/24 8:05 AM
Next scheduled update: 11/9/24 3:00 AM