Pelegrín Pelegrín, Blas Autor

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)

A continuous location model for siting a non-noxious undesirable facility within a geographical region

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

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH - 1/03/2000

10.1016/s0377-2217(99)00216-7

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

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

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)

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)

All Stackelberg location equilibria in the Hotelling's duopoly model on a tree with parametric prices

  • Perez, MDG
  • Pelegrin, BP

ANNALS OF OPERATIONS RESEARCH - 09/2003

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

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

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

Asignacion de recuerdos max-min: Propiedades y algoritmos

  • Conde A.
  • Pelegrín B.

Trabajos de Investigacion Operativa - 1/12/1991

10.1007/bf02888583

Número de citas:

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

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

NETWORKS and SPATIAL ECONOMICS - 15/12/2018

10.1007/s11067-019-09463-8

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

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:

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

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)

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: 2/11/24 8:05
Próxima recolección programada: 9/11/24 3:00