Pelegrín Pelegrín, Blas Author

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

  • Marin, A
  • Pelegrin, B

COMPUTERS & OPERATIONS RESEARCH - 1/7/1997

10.1016/s0305-0548(96)00078-0

Cite count: 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/3/2000

10.1016/s0377-2217(99)00216-7

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

Cite count: 8 (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/5/2023

10.1007/s11590-022-01938-x

Cite count: 2 (Web of Science)

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/6/2007

10.1016/j.ejor.2005.03.075

Cite count: 22 (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/3/2000

10.1016/s0377-2217(99)00033-8

Cite count: 20 (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 - 9/2003

Cite count: 15 (Web of Science)

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/1/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)

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/12/2008

10.1007/s11750-008-0055-2

Cite count: 9 (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

Cite count:

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)

Ranking-based Algorithm for Facility Location with Constraints

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

14TH INTERNATIONAL GLOBAL OPTIMIZATION WORKSHOP (LEGO) - 12/2/2019

10.1063/1.5089997

Cite count:

Ranking-based Discrete Optimization Algorithm for Asymmetric Competitive Facility Location

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

PROCEEDINGS OF THE 2019 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE COMPANION (GECCCO'19 COMPANION) - 13/7/2019

10.1145/3319619.3321893

Cite count:
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.

COMPUTATIONAL SCIENCE AND ITS APPLICATIONS (ICCSA 2018), PT II - 1/1/2018

10.1007/978-3-319-95165-2_41

Cite count: 1 (Web of Science)

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

Last data update: 11/23/24 8:20 AM
Next scheduled update: 11/30/24 3:00 AM