Conditional Location Problems on Networks and in the Plane
From MaRDI portal
Recommendations
- Technical Note—Conditional Location Problems on Networks
- The zone-constrained location problem on a network
- Mixed planar/network facility location problems
- An Analysis of Network Location Problems with Distance Constraints
- Some new algorithms for location problems on networks
- scientific article; zbMATH DE number 3960894
- Two classes of location problems on tree networks
- scientific article; zbMATH DE number 3847184
- scientific article; zbMATH DE number 849181
- The maximin-maxisum network location problem
Cites work
- A competitive facility location problem on a tree network with stochastic weights.
- A Continuous Model for Multistore Competitive Location
- A new chance-constrained maximum capture location problem
- A robust and efficient algorithm for planar competitive location problems
- Algorithms for Voting and Competitive Location on a Network
- All Stackelberg location equilibria in the Hotelling's duopoly model on a tree with parametric prices
- An alternating heuristic for medianoid and centroid problems in the plane
- An improved branch \& bound method for the uncapacitated competitive location problem
- Competitive facility location and design problem
- Competitive facility location model with concave demand
- Competitive facility location: the Voronoi game
- Competitive Location Models: A Framework and Bibliography
- Competitive Location on a Network
- Discretization and resolution of the \((r| X_ p)\)-medianoid problem involving quality criteria.
- Discretization results for the Huff and Pareto-Huff competitive location models on networks
- Existence theory for spatially competitive network facility location models
- Facilities location in a competitive environment: A Promethee based multiple criteria analysis
- Geometric complexity of some location problems
- Hotelling's duopoly on a tree
- How bad can a voting locating be
- Incorporating waiting time in competitive location models
- Locating multiple competitive facilities: Spatial interaction models with variable expenditures
- Maximal covering location problem with price decision for revenue maximization in a competitive environment
- Multiple voting location and single voting location on trees
- Networks with Condorcet solutions
- New perspectives in competitive location theory
- On a profit maximizing location model
- On locating new facilities in a competitive environment
- Optimizing the size and locations of facilities in competitive multi-site service systems
- Outcomes of voting and planning in single facility location problems
- Perception and information in a competitive location model
- Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure
- Reachability of locational Nash equilibria
- Relaxation of the Condorcet and Simpson conditions in voting location
- Sequential discrete p-facility models for competitive location planning
- Sequential location problems
- Single facility location on a network under mill and delivered pricing
- Solving a huff-like competitive location and design model for profit maximization in the plane
- Solving the competitive discretionary service facility location problem
- Solving the multiple competitive facilities location problem
- Some Generalizations of Social Decisions under Majority Rule
- Static competitive facility location: an overview of optimisation approaches.
- The leader-follower location model
- The maximum capture problem with heterogeneous customers
- The maximum capture problem with random utilities: problem formulation and algorithms
- The Maximum Coverage Location Problem
Cited in
(9)- Inventory, transportation, service quality and the location of distribution centers
- Perspectives on modeling hub location problems
- The \((1 | 1)\)-centroid problem in the plane with distance constraints
- Hub location under competition
- New approach to facility locations decisions
- Sequential competitive location on networks
- A note on the warehouse location problem with data contamination
- On agglomeration in competitive location models
- Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game
This page was built for publication: Conditional Location Problems on Networks and in the Plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5506724)
