scientific article
From MaRDI portal
Publication:3971522
zbMath0747.90057MaRDI QIDQ3971522
Publication date: 25 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Models and algorithms for competitive facility location problems with different customer behavior, Competitive location on a network, A conditional \(p\)-hub location problem with attraction functions, Competitive facility location: the Voronoi game, Parallelization of a non-linear multi-objective optimization algorithm: application to a location problem, Improved algorithms for some competitive location centroid problems on paths, trees and graphs, The (1|1)-Centroid Problem in the Plane with Distance Constraints, Branch-and-bound algorithm for a competitive facility location problem, A local search heuristic for the \((r| p)\)-centroid problem in the plane, A planar single-facility competitive location and design problem under the multi-deterministic choice rule, New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior, \((r|p)\)-centroid problems on networks with vertex and edge demand, A robust model for a leader-follower competitive facility location problem in a discrete space, A discrete long-term location--price problem under the assumption of discriminatory pricing: formulations and parametric analysis, Location and layout planning. A survey, Locations on time-varying networks, Multiple voting location and single voting location on trees, Competitive facility location and design problem, The leader-follower location model, An exact procedure and LP formulations for the leader-follower location problem, Reachability of locational Nash equilibria, A two-player competitive discrete location model with simultaneous decisions, An exact method for the discrete \((r|p)\)-centroid problem, Sequential customers' decisions in facility location with comparison-shopping, The generalized discrete ‐centroid problem, Isodistant points in competitive network facility location, A refinement of the gravity model for competitive facility location, Gradual cover competitive facility location, Word of Mouth: Rumor Dissemination in Social Networks, The discrete facility location problem with balanced allocation of customers, A kernel search matheuristic to solve the discrete leader-follower location problem, Sequential competitive location on networks, Competitive facility location and design with reactions of competitors already in the market, A continuum perspective of customer choice rules for competitive facility location problems, On the complexity of the \((r|p)\)-centroid problem in the plane, Fast metaheuristics for the discrete \((r|p)\)-centroid problem, Randomized local search for the discrete competitive facility location problem, Voronoi game on graphs, Multiple voting location problems, On a general network location--production--allocation problem, Profit maximization and reduction of the cannibalization effect in chain expansion, A location-allocation problem for a web services provider in a competitive market, Competitive location in the plane, The \(p\)-median problem under uncertainty, Improving solution of discrete competitive facility location problems, Static competitive facility location: an overview of optimisation approaches., Relaxed voting and competitive location under monotonous gain functions on trees, Local search algorithms for the problem of competitive location of enterprises, Discretization and resolution of the \((r| X_ p)\)-medianoid problem involving quality criteria., 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, Nash equilibria in location games on a network, Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule, Facility dependent distance decay in competitive location, On the use of genetic algorithms to solve location problems, A comparison of formulations and solution methods for the minimum-envy location problem, Location-allocation on a line with demand-dependent costs, 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, Sequential location problems, \((r,p)\)-centroid problems on paths and trees, Searching for equilibrium positions in a game of political competition with restrictions, Some personal views on the current state and the future of locational analysis, Solving the multiple competitive facilities location problem, The maximum capture problem with random utilities: problem formulation and algorithms, Store location with multipurpose shopping trips and a new random utility customers' choice model, Discrete Competitive Facility Location: Modeling and Optimization Approaches, Relaxation of the Condorcet and Simpson conditions in voting location, An alternating heuristic for medianoid and centroid problems in the plane
