The following pages link to (Q3971522):
Displayed 50 items.
- Models and algorithms for competitive facility location problems with different customer behavior (Q276530) (← links)
- Parallelization of a non-linear multi-objective optimization algorithm: application to a location problem (Q299429) (← links)
- Branch-and-bound algorithm for a competitive facility location problem (Q336436) (← links)
- A local search heuristic for the \((r| p)\)-centroid problem in the plane (Q337239) (← links)
- \((r|p)\)-centroid problems on networks with vertex and edge demand (Q339626) (← links)
- A robust model for a leader-follower competitive facility location problem in a discrete space (Q345745) (← links)
- Sequential competitive location on networks (Q439407) (← links)
- Competitive facility location and design with reactions of competitors already in the market (Q439603) (← links)
- On the complexity of the \((r|p)\)-centroid problem in the plane (Q456933) (← links)
- Fast metaheuristics for the discrete \((r|p)\)-centroid problem (Q463377) (← links)
- Randomized local search for the discrete competitive facility location problem (Q463379) (← links)
- Voronoi game on graphs (Q476871) (← links)
- Profit maximization and reduction of the cannibalization effect in chain expansion (Q512981) (← links)
- Improving solution of discrete competitive facility location problems (Q526408) (← links)
- An exact procedure and LP formulations for the leader-follower location problem (Q611000) (← links)
- A two-player competitive discrete location model with simultaneous decisions (Q613464) (← links)
- The discrete facility location problem with balanced allocation of customers (Q631097) (← links)
- Competitive location in the plane (Q689241) (← links)
- Discretization and resolution of the \((r| X_ p)\)-medianoid problem involving quality criteria. (Q703293) (← links)
- A conditional \(p\)-hub location problem with attraction functions (Q833528) (← links)
- A discrete long-term location--price problem under the assumption of discriminatory pricing: formulations and parametric analysis (Q864023) (← links)
- Multiple voting location and single voting location on trees (Q877040) (← links)
- Competitive facility location and design problem (Q879283) (← links)
- The leader-follower location model (Q883197) (← links)
- An exact method for the discrete \((r|p)\)-centroid problem (Q887194) (← links)
- Multiple voting location problems (Q933517) (← links)
- A location-allocation problem for a web services provider in a competitive market (Q953425) (← links)
- Relaxed voting and competitive location under monotonous gain functions on trees (Q968153) (← links)
- Generalized coverage: new developments in covering location models (Q976025) (← links)
- 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 (Q976129) (← links)
- A comparison of formulations and solution methods for the minimum-envy location problem (Q1000990) (← links)
- Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree (Q1026238) (← links)
- A robust and efficient algorithm for planar competitive location problems (Q1026588) (← links)
- Location of retail facilities under conditions of uncertainty (Q1026589) (← links)
- \((r,p)\)-centroid problems on paths and trees (Q1034634) (← links)
- Searching for equilibrium positions in a game of political competition with restrictions (Q1038350) (← links)
- On a general network location--production--allocation problem (Q1183612) (← links)
- Location-allocation on a line with demand-dependent costs (Q1268427) (← links)
- Sequential location problems (Q1278482) (← links)
- Some personal views on the current state and the future of locational analysis (Q1291654) (← links)
- Location and layout planning. A survey (Q1372765) (← links)
- Reachability of locational Nash equilibria (Q1387941) (← links)
- A planar single-facility competitive location and design problem under the multi-deterministic choice rule (Q1652088) (← links)
- New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior (Q1652139) (← links)
- Solving the multiple competitive facilities location problem (Q1847246) (← links)
- The maximum capture problem with random utilities: problem formulation and algorithms (Q1848399) (← links)
- Relaxation of the Condorcet and Simpson conditions in voting location (Q1869503) (← links)
- An alternating heuristic for medianoid and centroid problems in the plane (Q1870807) (← links)
- Competitive facility location: the Voronoi game (Q1884986) (← links)
- Isodistant points in competitive network facility location (Q1939096) (← links)