Conditional Location Problems on Networks and in the Plane

DOI10.1007/978-1-4419-7572-0_9zbMath1387.90110MaRDI QIDQ5506724

Abdullah Dasci

Publication date: 16 December 2016

Published in: International Series in Operations Research & Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4419-7572-0_9

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B10: Deterministic network models in operations research

90B80: Discrete location and assignment

Related Items

Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game, Hub location under competition, Sequential competitive location on networks, On agglomeration in competitive location models, Perspectives on modeling hub location problems, The (1|1)-Centroid Problem in the Plane with Distance Constraints

Cites Work

• Hotelling's duopoly on a tree
• Discretization and resolution of the \((r| X_ p)\)-medianoid problem involving quality criteria.
• Solving a huff-like competitive location and design model for profit maximization in the plane
• Competitive facility location model with concave demand
• Multiple voting location and single voting location on trees
• Competitive facility location and design problem
• Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure
• Incorporating waiting time in competitive location models
• The leader-follower location model
• Existence theory for spatially competitive network facility location models
• A robust and efficient algorithm for planar competitive location problems
• Maximal covering location problem with price decision for revenue maximization in a competitive environment
• Networks with Condorcet solutions
• Outcomes of voting and planning in single facility location problems
• How bad can a voting locating be
• Geometric complexity of some location problems
• New perspectives in competitive location theory
• On locating new facilities in a competitive environment
• Facilities location in a competitive environment: A Promethee based multiple criteria analysis
• Sequential location problems
• Discretization results for the Huff and Pareto-Huff competitive location models on networks
• Perception and information in a competitive location model
• Reachability of locational Nash equilibria
• An improved branch \& bound method for the uncapacitated competitive location problem
• A new chance-constrained maximum capture location problem
• All Stackelberg location equilibria in the Hotelling's duopoly model on a tree with parametric prices
• A competitive facility location problem on a tree network with stochastic weights.
• The maximum capture problem with heterogeneous customers
• Solving the multiple competitive facilities location problem
• The maximum capture problem with random utilities: problem formulation and algorithms
• Solving the competitive discretionary service facility location problem
• Relaxation of the Condorcet and Simpson conditions in voting location
• An alternating heuristic for medianoid and centroid problems in the plane
• Locating multiple competitive facilities: Spatial interaction models with variable expenditures
• Sequential discrete \(p\)-facility models for competitive location planning
• Competitive facility location: the Voronoi game
• Optimizing the size and locations of facilities in competitive multi-site service systems
• The Maximum Coverage Location Problem
• Competitive Location on a Network
• Algorithms for Voting and Competitive Location on a Network
• Some Generalizations of Social Decisions under Majority Rule
• Competitive Location Models: A Framework and Bibliography
• A Continuous Model for Multistore Competitive Location
• Single facility location on a network under mill and delivered pricing
• Static competitive facility location: an overview of optimisation approaches.
• On a profit maximizing location model