Outcomes of voting and planning in single facility location problems

DOI10.1016/0377-2217(85)90003-7zbMath0567.90022OpenAlexW2015403902MaRDI QIDQ1060128

Martine Labbé

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0377-2217(85)90003-7

zbMATH Keywords

medianpolynomial algorithmCondorcet pointoptimal solutionnetwork locationcactusplanning procedurevoting procedure

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Related Items

How bad can a voting locating be, Competitive location on a network, On condorcet and median points of simple rectilinear polygons, Comparison of Condorcet and Weber solutions on a plane: social choice versus centralization, The discrete facility location problem with balanced allocation of customers, Sequential competitive location on networks, Condorcet winner configurations of linear networks, Comparison of \(\alpha\)-Condorcet points with median and center locations, Outcomes of bargaining and planning in single facility location problems, A comparison of formulations and solution methods for the minimum-envy location problem, Some personal views on the current state and the future of locational analysis, Conditional Location Problems on Networks and in the Plane, Relaxation of the Condorcet and Simpson conditions in voting location

Cites Work

• Unnamed Item
• Unnamed Item
• Networks with Condorcet solutions
• New perspectives in competitive location theory
• On locating new facilities in a competitive environment
• Equivalence of Solutions to Network Location Problems
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph