Competitive location on a network

DOI10.1016/0377-2217(93)90224-BzbMath0779.90052OpenAlexW1993016620MaRDI QIDQ2367390

Wolfgang Domschke, Andreas Bauer, Erwin Pesch

Publication date: 25 August 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)90224-b

zbMATH Keywords

polynomial algorithmsCondorcet pointcompetitive locationSimpson pointlocation on a networksuboptimal points

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Related Items (7)

Competitive location and pricing on networks with random utilities ⋮ \((r|p)\)-centroid problems on networks with vertex and edge demand ⋮ Reachability of locational Nash equilibria ⋮ Sequential competitive location on networks ⋮ Facility location models for distribution system design ⋮ Competitive location, production, and market selection ⋮ Sequential location problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Location and layout planning. An international bibliography
• Networks with Condorcet solutions
• Outcomes of voting and planning in single facility location problems
• How bad can a voting locating be
• New perspectives in competitive location theory
• On locating new facilities in a competitive environment
• Competitive Location with Random Utilities
• Competitive Location on a Network
• Algorithms for Voting and Competitive Location on a Network
• Centroids and medians of finite metric spaces
• Equivalence of Solutions to Network Location Problems
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Products of absolute retracts

This page was built for publication: Competitive location on a network