( en | de | ru )

 

Disambiguation of "Pelegrín, Blas"

Author of the publication

copydeleteadd this publication to your clipboard
Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models.

, , , and . Comput. Oper. Res., 36 (5): 1393-1405 (2009)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Helga Blas

Rainer Bläs

Barbara Bläs

Barno Bläs

Blas Garrido

 

Other publications of authors with the same name

The Huff Versus the Pareto-Huff Customer Choice Rules in a Discrete Competitive Location Model., , , and . ICCSA (2), volume 10961 of Lecture Notes in Computer Science, page 583-592. Springer, (2018)On Nash equilibria of a competitive location-design problem., , and . Eur. J. Oper. Res., 210 (3): 588-593 (2011)Finding all pure strategy Nash equilibria in a planar location game., , , , and . Eur. J. Oper. Res., 214 (1): 91-98 (2011)Exact and heuristic solutions of a discrete competitive location model with Pareto-Huff customer choice rule., , , and . J. Comput. Appl. Math., (2021)Solution of Discrete Competitive Facility Location Problem for Firm Expansion., , , and . Informatica, 27 (2): 451-462 (2016)The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets., , , and . RAIRO Oper. Res., 36 (1): 1-19 (2002)The Minimum Covering lpb-Hypersphere Problem., and . Comput. Optim. Appl., 9 (1): 85-97 (1998)On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems., , , and . OR Spectrum, 31 (3): 601-627 (2009)Nash equilibria in location games on a network., and . OR Spectrum, 39 (3): 775-791 (2017)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., , and . Comput. Oper. Res., 29 (6): 609-623 (2002)