Pelegrín Pelegrín, Blas Autor

Algorithms for the decomposition of a polygon into convex polygons

  • Fernandez, J
  • Canovas, L
  • Pelegrin, B

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH - 1/03/2000

10.1016/s0377-2217(99)00033-8

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

Finding all pure strategy Nash equilibria in a planar location game

  • Diaz-Banez, J. M.
  • Heredia, M.
  • Pelegrin, B.
  • Perez-Lantero, P.
  • Ventura, I.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH - 1/10/2011

10.1016/j.ejor.2011.04.003

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

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

  • Fernandez, Pascual
  • Pelegrin, Blas
  • Garcia Perez, Maria Dolores
  • Peeters, Peter H.

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH - 16/06/2007

10.1016/j.ejor.2005.03.075

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

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

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

European Journal of Operational Research - 16/6/2007

10.1016/j.ejor.2006.02.005

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

On the location of new routes to a destination for airline expansion

  • Pelegrin Pelegrin, Blas
  • Fernandez Hernandez, Pascual
  • Pelegrin Garcia, Juan Diego

European Journal of Industrial Engineering - 1/1/2016

10.1504/ejie.2016.078806

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

Estimating actual distances by norm functions: a comparison between the lk,p,theta-norm and the lb1,b2,theta-norm and a study about the selection of the data set

  • Fernandez, J
  • Fernandez, P
  • Pelegrin, B

COMPUTERS & OPERATIONS RESEARCH - 1/05/2002

10.1016/s0305-0548(00)00045-9

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

A branch-and-bound algorithm for the transportation problem with location of p transshipment points

  • Marin, A
  • Pelegrin, B

COMPUTERS & OPERATIONS RESEARCH - 1/07/1997

10.1016/s0305-0548(96)00078-0

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

On the sum-max bicriterion path problem

  • Pelegrin, B
  • Fernandez, P

COMPUTERS & OPERATIONS RESEARCH - 1/12/1998

10.1016/s0305-0548(98)00036-7

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

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

  • Mesa, Juan A.
  • Pelegrin, Blas
  • Puerto, Justo

COMPUTERS and OPERATIONS RESEARCH - 1/05/2009

10.1016/j.cor.2008.02.005

Número de citas: 1 (Scopus)

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

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

COMPUTERS and OPERATIONS RESEARCH - 1/5/2009

10.1016/j.cor.2008.02.006

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

Número de citas: 12 (Scopus)
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:

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:

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: 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

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

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:

Este autor no tiene patentes.

Este autor no tiene informes ni otros tipos de publicaciones.

Scopus: 16

Web of Science: 17

Scopus: 23

Web of Science: 24

Última actualización de los datos: 4/05/24 3:15
Próxima recolección programada: 11/05/24 3:00