Blas Pelegrín

From MaRDI portal
Person:512978

Available identifiers

zbMath Open pelegrin.blasMaRDI QIDQ512978

List of research outcomes

PublicationDate of PublicationType
On the existence and computation of Nash equilibrium in network competitive location under delivered pricing and price sensitive demand2024-01-31Paper
Sequential customers' decisions in facility location with comparison-shopping2023-11-15Paper
A discrete competitive facility location model with proportional and binary rules sequentially applied2023-05-04Paper
Exact and heuristic solutions of a discrete competitive location model with Pareto-Huff customer choice rule2021-02-03Paper
Computation of multi-facility location Nash equilibria on a network under quantity competition2020-10-08Paper
Threshold distance versus side payment to reduce the cannibalization effect in retail chain expansion2019-09-25Paper
New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior2018-07-11Paper
Nash Equilibria in Network Facility Location Under Delivered Prices2018-02-14Paper
Nash equilibria in location games on a network2017-08-25Paper
Profit maximization and reduction of the cannibalization effect in chain expansion2017-03-03Paper
Estimating the Pareto Front of a Hard Bi-criterion Competitive Facility Location Problem2017-02-03Paper
Isodistant points in competitive network facility location2013-02-26Paper
Finding all pure strategy Nash equilibria in a planar location game2011-08-09Paper
On Nash equilibria of a competitive location-design problem2011-06-07Paper
On a branch-and-bound approach for a Huff-like Stackelberg location problem2009-06-30Paper
On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems2009-06-30Paper
A practical algorithm for decomposing polygonal domains into convex polygons by diagonals2009-02-17Paper
Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models2008-12-17Paper
Single facility location on a network under mill and delivered pricing2007-11-27Paper
GASUB: finding global optima to discrete location problems by a genetic-like algorithm2007-11-14Paper
The 1-center problem in the plane with independent random weights2007-10-19Paper
Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure2007-05-31Paper
A discrete long-term location--price problem under the assumption of discriminatory pricing: formulations and parametric analysis2007-02-12Paper
Solving a huff-like competitive location and design model for profit maximization in the plane2007-02-12Paper
https://portal.mardi4nfdi.de/entity/Q53952272006-11-02Paper
On the sum-max bicriterion path problem.2003-09-07Paper
Estimating actual distances by norm functions: A comparison between the \(l_{k,p,\theta}\)-norm and the \(l_{b_1,b_2,\theta}\)-norm and a study about the selection of the data set2002-04-03Paper
Algorithms for the decomposition of a polygon into convex polygons2001-12-05Paper
https://portal.mardi4nfdi.de/entity/Q27081102001-11-11Paper
A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem2001-02-22Paper
The return plant location problem: Modelling and resolution2001-02-22Paper
Using interval analysis for solving planar single-facility location problems: New discarding tests2001-02-18Paper
DECOPOL -- Codes for decomposing a polygon into convex subpolygons2000-11-21Paper
A continuous location model for siting a non-noxious undesirable facility within a geographical region2000-07-19Paper
https://portal.mardi4nfdi.de/entity/Q42549481999-12-13Paper
Applying Lagrangian relaxation to the resolution of two-stage location problems1999-06-10Paper
Location of paths on trees with minimal eccentricity and superior section1999-05-31Paper
The minimum covering \(l_{pb}\)-hypersphere problem1998-07-29Paper
https://portal.mardi4nfdi.de/entity/Q43836421998-07-27Paper
An improvement and an extension of the Elzinga \& Hearn's algorithm to the 1-center problem in \(\mathbb{R}^ n\) with \(l_{2b}\)-norms1998-05-06Paper
A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points1997-08-07Paper
New heuristic algorithms for the rectangular $p$-cover problem1995-07-31Paper
Heuristic methods for thep-center problem1991-01-01Paper
Determination of efficient solutions for point-objective locational decision problems1989-01-01Paper
Determination of efficient points in multiple-objective location problems1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47243961986-01-01Paper
On the uniqueness of optimal solutions in continuous location theory1985-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Blas Pelegrín