RDF/XML JSON-LD N3/Turtle RDF/JSON

Pelegrín Pelegrín, Blas Autor

Using interval analysis for solving planar single-facility location problems: New discarding tests

  • Fernandez, J
  • Pelegrin, B

JOURNAL OF GLOBAL OPTIMIZATION - 1/01/2001

10.1023/a:1008315927737

Número de citas: 17 (Web of Science) 18 (Scopus)
  • Cuartil SJR: Q2
  • CiteScore: 3,7 (2020)
  • SJR: 0,722 (2001)
  • SNIP: 1,148 (2001)
  • Categorías SJR: Applied Mathematics (Q2); Computer Science Applications (Q2); Management Science and Operations Research (Q2); Control and Optimization (Q3)

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

Número de citas:

Threshold distance versus side payment to reduce the cannibalization effect in retail chain expansion

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

IMA Journal of Management Mathematics - 1/01/2019

10.1093/imaman/dpx011

Número de citas: 2 (Web of Science) 1 (Scopus)
  • Cuartil SJR: Q1
  • Factor Impacto JCR: 1,529 (2019)
  • CiteScore: 3,1 (2020)
  • SJR: 0,91 (2019)
  • SNIP: 1,313 (2019)
  • Impacto JCR a 5 años: 1,525
  • Categorías JCR: SOCIAL SCIENCES, MATHEMATICAL METHODS
  • Categorías SJR: Economics, Econometrics and Finance (miscellaneous) (Q1); Management Information Systems (Q1); Modeling and Simulation (Q1); Strategy and Management (Q1); Applied Mathematics (Q2); Management Science and Operations Research (Q2)

The minimum covering l(pb)-hypersphere problem

  • Pelegrin, B
  • Canovas, L

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS - 1/01/1998

10.1023/a:1018334220639

Número de citas: 2 (Web of Science) 2 (Scopus)
  • CiteScore: 3,5 (2020)

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)
  • Cuartil SJR: Q3
  • CiteScore: 2,1 (2020)
  • SJR: 0,432 (2002)
  • SNIP: 0,668 (2002)
  • Categorías SJR: Computer Science Applications (Q3); Management Science and Operations Research (Q3); Theoretical Computer Science (Q3)

The 1-center problem in the plane with independent random weights

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

Computers and Operations Research - 1/3/2008

10.1016/j.cor.2006.05.003

Número de citas: 4 (Web of Science) 3 (Scopus)
  • Cuartil SJR: Q1
  • CiteScore: 8,2 (2020)
  • SJR: 2,199 (2008)
  • SNIP: 2,259 (2008)
  • Categorías SJR: Computer Science (miscellaneous) (Q1); Management Science and Operations Research (Q1); Modeling and Simulation (Q1)

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)
  • Cuartil JCR: Q2 (2007)
  • Cuartil SJR: Q1
  • Factor Impacto JCR: 1,096 (2022)
  • Impacto Normalizado por Categoría: 2,181 (2007)
  • CiteScore: 9,5 (2020)
  • SJR: 1,623 (2007)
  • SNIP: 1,982 (2007)
  • Categorías SJR: Information Systems and Management (Q1); Management Science and Operations Research (Q1); Modeling and Simulation (Q1)
Open Access

Solution of Discrete Competitive Facility Location Problem for Firm Expansion

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

INFORMATICA - 1/1/2016

10.15388/informatica.2016.94

Número de citas: 5 (Web of Science) 5 (Scopus)
  • Cuartil JCR: Q2 (2016)
  • Factor Impacto JCR: 1,056 (2022)
  • Impacto Normalizado por Categoría: 0,408 (2016)
  • CiteScore: 5 (2020)
  • SJR: 0,321 (2016)
  • SNIP: 0,875 (2016)
  • Impacto JCR a 5 años: 1,039
  • Categorías JCR: COMPUTER SCIENCE, INFORMATION SYSTEMS

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

Número de citas: 3 (Web of Science) 2 (Scopus)
  • Factor Impacto JCR: 3,643 (2020)
  • CiteScore: 5,1 (2020)
  • SJR: 0,626 (2020)
  • SNIP: 1,463 (2020)
  • Impacto JCR a 5 años: 3,518
  • Categorías JCR: COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Open Access

Sobre la localización de centros de una firma entrante con patrón binario de elección del consumidor

  • Pelegrín B.
  • Hernández P.
  • Pérez M.

Investigacion Operacional - 21/10/2013

Número de citas: 1 (Scopus)
  • Cuartil SJR: Q4
  • CiteScore: 0,6 (2020)
  • SJR: 0,117 (2013)
  • SNIP: 0,015 (2013)
  • Categorías SJR: Applied Mathematics (Q4); Numerical Analysis (Q4); Statistics and Probability (Q4)

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)
  • Cuartil SJR: Q3
  • CiteScore: 0,3 (2020)
  • SJR: 0,149 (2006)
  • SNIP: 0,141 (2006)
  • Categorías SJR: Economics, Econometrics and Finance (miscellaneous) (Q3); Mathematics (miscellaneous) (Q4)
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)
  • CiteScore: 0,8 (2020)
  • SJR: 0,157 (2017)
  • SNIP: 0,29 (2017)

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:
  • CiteScore: 1,5 (2020)
  • SJR: 0,185 (2020)
  • SNIP: 0,363 (2020)

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)
  • CiteScore: 9,5 (2020)
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:
  • CiteScore: 1,8 (2020)
  • SJR: 0,283 (2018)
  • SNIP: 0,707 (2018)

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:

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:
  • CiteScore: 0,7 (2020)
  • SJR: 0,19 (2019)
  • SNIP: 0,375 (2019)
  • Categorías SJR: Physics and Astronomy (miscellaneous)

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)
  • Cuartil SJR: Q1
  • CiteScore: 5,2 (2020)
  • SJR: 0,863 (1999)
  • SNIP: 0,664 (1999)
  • Categorías SJR: Decision Sciences (miscellaneous) (Q1); Management Science and Operations Research (Q1)

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)
  • CiteScore: 9,5 (2020)

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: 13/04/24 9:43
Próxima recolección programada: 20/04/24 3:00