Competitive location on a network

DOI10.1016/0377-2217(93)90224-BMaRDI QIDQ2367390zbMATH OpenOpenAlexFDO

Authors Andreas Bauer, Wolfgang Domschke, 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

competitive locationpolynomial algorithmsCondorcet pointSimpson pointlocation on a networksuboptimal points

Mathematics Subject Classification ID

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

Recommendations

• Algorithms for Voting and Competitive Location on a Network
• Competitive location under proportional choice: 1-suboptimal points on networks
• Competitive Location on a Network
• Competitive Location with Random Utilities
• Competitive location in the plane

Cites work

• scientific article; zbMATH DE number 3839870 (Why is no real title available?)
• scientific article; zbMATH DE number 4199949 (Why is no real title available?)
• scientific article; zbMATH DE number 3918092 (Why is no real title available?)
• scientific article; zbMATH DE number 4003873 (Why is no real title available?)
• scientific article; zbMATH DE number 3697163 (Why is no real title available?)
• scientific article; zbMATH DE number 3748742 (Why is no real title available?)
• scientific article; zbMATH DE number 9247 (Why is no real title available?)
• scientific article; zbMATH DE number 44761 (Why is no real title available?)
• Algorithms for Voting and Competitive Location on a Network
• Centroids and medians of finite metric spaces
• Competitive Location on a Network
• Competitive Location with Random Utilities
• Equivalence of Solutions to Network Location Problems
• How bad can a voting locating be
• Location and layout planning. An international bibliography
• Networks with Condorcet solutions
• New perspectives in competitive location theory
• On locating new facilities in a competitive environment
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Outcomes of voting and planning in single facility location problems
• Products of absolute retracts

Cited in

(16)

• NP-hardness of some competitive location models with probabilistic choice rules
• Competitive location and pricing on networks with random utilities
• Competitive Location on a Network
• \((r|p)\)-centroid problems on networks with vertex and edge demand
• Facility location models for distribution system design
• Algorithms for Voting and Competitive Location on a Network
• Strategy-proof location on a network
• Sequential competitive location on networks
• Location in a network with choice model defined by a threshold distance
• Reachability of locational Nash equilibria
• Isodistant points in competitive network facility location
• Sequential location problems
• How bad can a voting locating be
• Competitive location, production, and market selection
• Competitive location in the plane
• Efficient locations to optimize market share and maximum travel time in a duopoly competition model

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367390)