scientific article; zbMATH DE number 9247
From MaRDI portal
Publication:3971522
Recommendations
Cited in
(78)- New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior
- Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree
- Competitive facility location: the Voronoi game
- The generalized discrete ‐centroid problem
- The \(p\)-median problem under uncertainty
- Models and algorithms for competitive facility location problems with different customer behavior
- An exact method for the discrete \((r|p)\)-centroid problem
- Competitive location on a network
- Multiple voting location problems
- A robust model for a leader-follower competitive facility location problem in a discrete space
- Sequential location problems
- Improved algorithms for some competitive location centroid problems on paths, trees and graphs
- A continuum perspective of customer choice rules for competitive facility location problems
- Locating multiple competitive facilities: Spatial interaction models with variable expenditures
- The discrete facility location problem with balanced allocation of customers
- A location-allocation problem for a web services provider in a competitive market
- A comparison of formulations and solution methods for the minimum-envy location problem
- Generalized coverage: new developments in covering location models
- Competitive facility location and design with reactions of competitors already in the market
- Location and layout planning. A survey
- A conditional \(p\)-hub location problem with attraction functions
- A two-player competitive discrete location model with simultaneous decisions
- Competitive location in the plane
- Location-allocation on a line with demand-dependent costs
- 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
- Local search algorithms for the problem of competitive location of enterprises
- Relaxation of the Condorcet and Simpson conditions in voting location
- Competitive facility location and design problem
- Multiple voting location and single voting location on trees
- Solving the multiple competitive facilities location problem
- A robust and efficient algorithm for planar competitive location problems
- Word of Mouth: Rumor Dissemination in Social Networks
- 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
- A discrete long-term location--price problem under the assumption of discriminatory pricing: formulations and parametric analysis
- \((r,p)\)-centroid problems on paths and trees
- \((r|p)\)-centroid problems on networks with vertex and edge demand
- Sequential competitive location on networks
- Competitive spatial models
- Relaxed voting and competitive location under monotonous gain functions on trees
- Reachability of locational Nash equilibria
- An alternating heuristic for medianoid and centroid problems in the plane
- Searching for equilibrium positions in a game of political competition with restrictions
- The leader-follower location model
- Discretization and resolution of the \((r| X_ p)\)-medianoid problem involving quality criteria.
- Some personal views on the current state and the future of locational analysis
- The maximum capture problem with random utilities: problem formulation and algorithms
- On the core of a class of location games
- Improving solution of discrete competitive facility location problems
- An exact procedure and LP formulations for the leader-follower location problem
- Branch-and-bound algorithm for a competitive facility location problem
- The \((1 | 1)\)-centroid problem in the plane with distance constraints
- A local search heuristic for the \((r| p)\)-centroid problem in the plane
- On the use of genetic algorithms to solve location problems
- Profit maximization and reduction of the cannibalization effect in chain expansion
- Global and local players in a model of spatial competition
- Parallelization of a non-linear multi-objective optimization algorithm: application to a location problem
- Discrete competitive facility location: modeling and optimization approaches
- Voronoi game on graphs
- Isodistant points in competitive network facility location
- Location of retail facilities under conditions of uncertainty
- Static competitive facility location: an overview of optimisation approaches.
- A refinement of the gravity model for competitive facility location
- A Huff-like location model with quality adjustment and/or closing of existing facilities
- Sequential customers' decisions in facility location with comparison-shopping
- Gradual cover competitive facility location
- Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule
- Facility dependent distance decay in competitive location
- Competitive location models: a review
- A planar single-facility competitive location and design problem under the multi-deterministic choice rule
- Robust model of discrete competitive facility location problem with partially proportional rule
- Nash equilibria in location games on a network
- A kernel search matheuristic to solve the discrete leader-follower location problem
- Locations on time-varying networks
- Store location with multipurpose shopping trips and a new random utility customers' choice model
- Spatial competition and social welfare considering different feasible location regions
- On a general network location--production--allocation problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3971522)
