Pelegrín Pelegrín, Blas Author

Asignacion de recuerdos max-min: Propiedades y algoritmos

  • Conde A.
  • Pelegrín B.

Trabajos de Investigacion Operativa - 1/12/1991

10.1007/bf02888583

Cite count:

Heuristicas de descomposicion lagrangiana para algunos problemas de localizacion discreta

  • Pérez A.
  • Pelegrín B.

Trabajos de Investigacion Operativa - 1/12/1992

10.1007/bf02888252

Cite count: 1 (Scopus)

Un algoritmo para determinar las medianas absolutas generales sobre una red tipo arbol

  • Pelegrín B.

Trabajos de Estadistica y de Investigacion Operativa - 1/2/1982

10.1007/bf02888703

Cite count:

El critrio del valor esperado en un modelo de localizacion industrial

  • Pelegrín B.

Trabajos de Estadistica y de Investigacion Operativa - 1/10/1983

10.1007/bf02888792

Cite count:

A practical algorithm for decomposing polygonal domains into convex polygons by diagonals

  • Fernández J.
  • Tóth B.
  • Cánovas L.
  • Pelegrín B.

TOP - 1/1/2008

10.1007/s11750-008-0055-2

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

Multiobjective routing problems

  • Boffey B.
  • García F.
  • Laporte G.
  • Mesa J.
  • Pelegrín B.

Top - 1/12/1995

10.1007/bf02568585

Cite count: 17 (Scopus)

Isodistant points in competitive network facility location

  • Pelegrin, Blas
  • Suarez-Vega, Rafael
  • Cano, Saul

Top - 1/10/2012

10.1007/s11750-010-0148-6

Cite count: 8 (Web of Science) 7 (Scopus)
Open Access

Estimating the pareto front of a hard Bi-criterion competitive facility location problem

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

Springer Optimization and Its Applications - 1/1/2016

10.1007/978-3-319-29975-4_14

Cite count:

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)

Effect of production and transportation costs on the optimal locations of distribution centers

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

Revista de Economia Aplicada - 12/2013

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

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:

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)

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)

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:

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: 5/25/24 9:43 AM
Next scheduled update: 6/1/24 3:00 AM