Pelegrín Pelegrín, Blas Author

RHETORIC OF PLEASURE + ESSENCE OF SEMIOTICS IN WORKS OF GRACIAN,BALTHASAR

  • PELEGRIN, B

POETIQUE - 1979

Cite count: 1 (Web of Science)

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:

ON THE UNIQUENESS OF OPTIMAL-SOLUTIONS IN CONTINUOUS LOCATION THEORY

  • PELEGRIN, B
  • MICHELOT, C
  • PLASTRIA, F

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH - 1/1/1985

10.1016/0377-2217(85)90005-0

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

DETERMINATION OF EFFICIENT POINTS IN MULTIPLE-OBJECTIVE LOCATION-PROBLEMS

  • PELEGRIN, B
  • FERNANDEZ, FR

NAVAL RESEARCH LOGISTICS - 1/12/1988

10.1002/1520-6750(198812)35:6<697::aid-nav3220350613>3.0.co;2-8

Cite count: 20 (Web of Science) 25 (Scopus)

Determination of efficient solutions for point-objective locational decision problems

  • Pelegrin B.
  • Fernandez F.

Annals of Operations Research - 1/12/1989

10.1007/bf02097797

Cite count: 3 (Scopus)

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:

HEURISTIC METHODS FOR THE RHO-CENTER PROBLEM

  • PELEGRIN, B

RAIRO-RECHERCHE OPERATIONNELLE-OPERATIONS RESEARCH - 1991

Cite count: 7 (Web of Science)

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)

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)

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)

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

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)

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:

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