Pelegrín Pelegrín, Blas Author
Estimating actual distances by norm functions: a comparison between the lk,p,theta-norm and the lb1,b2,theta-norm and a study about the selection of the data set
- Fernandez, J
- Fernandez, P
- Pelegrin, B
COMPUTERS & OPERATIONS RESEARCH - 1/05/2002
- SJR Quartile: Q1
- CiteScore: 8.2 (2020)
- SJR: 0.96 (2002
- SNIP: 1.47 (2002
- SJR Categories: Computer Science (miscellaneous) (Q1); Modeling and Simulation (Q1); Management Science and Operations Research (Q2)
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
- SJR Quartile: Q3
- CiteScore: 2.1 (2020)
- SJR: 0.432 (2002
- SNIP: 0.668 (2002
- SJR Categories: Computer Science Applications (Q3); Management Science and Operations Research (Q3); Theoretical Computer Science (Q3)
Using interval analysis for solving planar single-facility location problems: New discarding tests
- Fernandez, J
- Pelegrin, B
JOURNAL OF GLOBAL OPTIMIZATION - 1/01/2001
- SJR Quartile: Q2
- CiteScore: 3.7 (2020)
- SJR: 0.722 (2001
- SNIP: 1.148 (2001
- SJR Categories: Applied Mathematics (Q2); Computer Science Applications (Q2); Management Science and Operations Research (Q2); Control and Optimization (Q3)
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
- SJR Quartile: Q1
- CiteScore: 9.5 (2020)
- SJR: 1.065 (2000
- SNIP: 1.154 (2000
- SJR Categories: Information Systems and Management (Q1); Management Science and Operations Research (Q1); Modeling and Simulation (Q1)
Algorithms for the decomposition of a polygon into convex polygons
- Fernandez, J
- Canovas, L
- Pelegrin, B
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH - 1/03/2000
- SJR Quartile: Q1
- CiteScore: 9.5 (2020)
- SJR: 1.065 (2000
- SNIP: 1.154 (2000
- SJR Categories: Information Systems and Management (Q1); Management Science and Operations Research (Q1); Modeling and Simulation (Q1)
On the sum-max bicriterion path problem
- Pelegrin, B
- Fernandez, P
COMPUTERS & OPERATIONS RESEARCH - 1/12/1998
- CiteScore: 8.2 (2020)
The minimum covering l(pb)-hypersphere problem
- Pelegrin, B
- Canovas, L
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS - 1/01/1998
- CiteScore: 3.5 (2020)
DECOPOL - Codes for decomposing a polygon into convex subpolygons
- Fernandez, J
- Canovas, L
- Pelegrin, B
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH - 1/10/1997
- CiteScore: 9.5 (2020)
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
- CiteScore: 8.2 (2020)
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
- CiteScore: 1.5 (2020)
- SJR: 0.185 (2020
- SNIP: 0.363 (2020
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
- CiteScore: 0.8 (2020)
- SJR: 0.157 (2017
- SNIP: 0.29 (2017
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
- SJR Quartile: Q3
- CiteScore: 0.3 (2020)
- SJR: 0.149 (2006
- SNIP: 0.141 (2006
- SJR Categories: Economics, Econometrics and Finance (miscellaneous) (Q3); Mathematics (miscellaneous) (Q4)
- Scopus
- ORCID
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
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
- CiteScore: 0.7 (2020)
- SJR: 0.19 (2019
- SNIP: 0.375 (2019
- SJR Categories: Physics and Astronomy (miscellaneous)
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
- CiteScore: 1.8 (2020)
- SJR: 0.283 (2018
- SNIP: 0.707 (2018
Applying Lagrangian relaxation to the resolution of two-stage location problems
- Marin, A
- Pelegrin, B
ANNALS OF OPERATIONS RESEARCH - 1/1/1999
- SJR Quartile: Q1
- CiteScore: 5.2 (2020)
- SJR: 0.863 (1999
- SNIP: 0.664 (1999
- SJR Categories: Decision Sciences (miscellaneous) (Q1); Management Science and Operations Research (Q1)
The return plant location problem: Modelling and resolution
- Marin, A
- Pelegrin, B
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH - 16/01/1998
- CiteScore: 9.5 (2020)
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
- CiteScore: 9.5 (2020)
This author has no patents.
This author has no reports or other types of publications.
h index
Scopus: 16
Web of Science: 17
i10 index
Scopus: 23
Web of Science: 24
Author profiles
-
ORCID
-
Web of Science ResearcherID
-
Scopus Author ID
-
Dialnet id
Other identifiers
-
URI Datos BNE
-
ISNI
-
VIAF
Research projects at UAL
-
Acronym HH2004-0014Since: January 1, 2005Until: December 31, 2006Funded by: MECFunding / grant amount: 8,000.00 EURRole: Investigador