Pelegrín Pelegrín, Blas Autor

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

Número de citas: 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

Número de citas: 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

Número de citas:
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 (Netherlands) - 1/1/2020

10.15388/20-infor410

Número de citas: 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

Número de citas: 2 (Web of Science) 1 (Scopus)

Computation of Multi-facility Location Nash Equilibria on a Network Under Quantity Competition

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

NETWORKS & SPATIAL ECONOMICS - 15/12/2018

10.1007/s11067-019-09463-8

Número de citas: 5 (Web of Science) 6 (Scopus)

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

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

Computers and Operations Research - 1/3/2017

10.1016/j.cor.2016.10.002

Número de citas: 14 (Web of Science) 17 (Scopus)

Improving solution of discrete competitive facility location problems

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

Optimization Letters - 1/2/2017

10.1007/s11590-015-0930-3

Número de citas: 12 (Web of Science) 12 (Scopus)

Nash equilibria in location games on a network

  • Pelegrin, Mercedes
  • Pelegrin, Blas

OR SPECTRUM - 1/07/2017

10.1007/s00291-017-0472-4

Número de citas: 2 (Web of Science) 2 (Scopus)

Profit maximization and reduction of the cannibalization effect in chain expansion

  • Pelegrin, Blas
  • Fernandez, Pascual
  • Garcia Perez, Maria Dolores

ANNALS OF OPERATIONS RESEARCH - 1/11/2016

10.1007/s10479-014-1676-5

Número de citas: 5 (Web of Science) 6 (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

Número de citas:
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

Número de citas: 1 (Web of Science) 1 (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

Número de citas:

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

Número de citas:
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

Número de citas:

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

  • Pelegrín B.
  • Redondo J.
  • Fernández P.
  • García I.
  • Ortigosa P.

Journal of Global Optimization - 1/6/2007

10.1007/s10898-006-9076-2

Número de citas: 8 (Web of Science) 12 (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

Número de citas: 12 (Scopus)

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

Número de citas: 32 (Web of Science) 40 (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

Número de citas: 6 (Web of Science) 7 (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

Número de citas: 64 (Web of Science) 90 (Scopus)

Este autor no tiene patentes.

Este autor no tiene informes ni otros tipos de publicaciones.

Scopus: 16

Web of Science: 14

Scopus: 23

Web of Science: 21

Última actualización de los datos: 24/09/22 7:08
Próxima recolección programada: 1/10/22 3:00