Publication:3971522

From MaRDI portal
Revision as of 00:22, 30 January 2024 by Import240129110155 (talk | contribs) (Created automatically from import240129110155)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


zbMath0747.90057MaRDI QIDQ3971522

S. Louis Hakimi

Publication date: 25 June 1992



90C40: Markov and semi-Markov decision processes

90B80: Discrete location and assignment


Related Items

Unnamed Item, Static competitive facility location: an overview of optimisation approaches., On the use of genetic algorithms to solve location problems, Sequential competitive location on networks, Competitive facility location and design with reactions of competitors already in the market, An exact procedure and LP formulations for the leader-follower location problem, A two-player competitive discrete location model with simultaneous decisions, The discrete facility location problem with balanced allocation of customers, Competitive location in the plane, Discretization and resolution of the \((r| X_ p)\)-medianoid problem involving quality criteria., A conditional \(p\)-hub location problem with attraction functions, A discrete long-term location--price problem under the assumption of discriminatory pricing: formulations and parametric analysis, Multiple voting location and single voting location on trees, Competitive facility location and design problem, The leader-follower location model, Multiple voting location problems, A location-allocation problem for a web services provider in a competitive market, Relaxed voting and competitive location under monotonous gain functions on trees, Generalized coverage: new developments in covering location models, An \(O(n(\log n)^{2}/\log \log n)\) algorithm for the single maximum coverage location or the \((1,X_p)\)-medianoid problem on trees, A comparison of formulations and solution methods for the minimum-envy location problem, Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree, A robust and efficient algorithm for planar competitive location problems, Location of retail facilities under conditions of uncertainty, \((r,p)\)-centroid problems on paths and trees, Searching for equilibrium positions in a game of political competition with restrictions, On a general network location--production--allocation problem, Location-allocation on a line with demand-dependent costs, Sequential location problems, Some personal views on the current state and the future of locational analysis, Location and layout planning. A survey, Reachability of locational Nash equilibria, Solving the multiple competitive facilities location problem, The maximum capture problem with random utilities: problem formulation and algorithms, Relaxation of the Condorcet and Simpson conditions in voting location, An alternating heuristic for medianoid and centroid problems in the plane, Competitive facility location: the Voronoi game, Isodistant points in competitive network facility location, Competitive location on a network, The \(p\)-median problem under uncertainty, Word of Mouth: Rumor Dissemination in Social Networks