Pelegrín Pelegrín, Blas Autor

HEURISTIC METHODS FOR THE RHO-CENTER PROBLEM

  • PELEGRIN, B

RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH - 1991

Número de citas: 7 (Web of Science)

NEW HEURISTIC ALGORITHMS FOR THE RECTANGULAR P-COVER PROBLEM

  • PELEGRIN, B
  • CANOVAS, L

RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH - 1995

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

The Maximum Capacity Shortest Path problem: Generation of efficient solution sets

  • Boffey, TB
  • Williams, RC
  • Pelegrin, B
  • Fernandez, P

RAIRO-OPERATIONS RESEARCH - 1/01/2002

10.1051/ro:2002002

Número de citas: 3 (Web of Science) 3 (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: 4 (Web of Science) 2 (Scopus)

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

  • Elena Sáiz M.
  • Hendrix E.
  • Fernández J.
  • Pelegrín B.

OR SPECTRUM - 1/6/2009

10.1007/s00291-008-0133-8

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

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

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

OR SPECTRUM - 1/6/2009

10.1007/s00291-008-0163-2

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

Finding multiple global optima for unconstrained discrete location problems

  • Redondo J.
  • Pelegrin B.
  • Fernandez P.
  • Garcia I.
  • Ortigosa P.

Optimization Methods and Software - 1/4/2011

10.1080/10556780903567760

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

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

Número de citas:

On tie breaking in competitive location under binary customer behavior

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

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE - 1/04/2015

10.1016/j.omega.2014.10.010

Número de citas: 6 (Web of Science) 5 (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: 27/04/24 9:37
Próxima recolección programada: 4/05/24 3:00