Algorithms for Voting and Competitive Location on a Network

DOI10.1287/TRSC.22.4.278MaRDI QIDQ3818091zbMATH OpenOpenAlexFDO

Authors Pierre Hansen, Martine Labbé

Publication date 1988

Published in Transportation Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/trsc.22.4.278

zbMATH Keywords

competitive settingCondorcet pointfacility locationnetworkPolynomial algorithmsSimpson pointvoting procedure

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Recommendations

• How bad can a voting locating be
• Distance weighted voting and a single facility location problem
• Competitive location on a network
• The tolerant Condorcet points
• scientific article; zbMATH DE number 4199949

Cited in

(32)

• \((r,p)\)-centroid problems on paths and trees
• Networks with Condorcet solutions
• Outcomes of voting and planning in single facility location problems
• How bad can a voting locating be
• Distance weighted voting and a single facility location problem
• Sequential location problems
• Perception and information in a competitive location model
• Ordered weighted average optimization in multiobjective spanning tree problem
• A competitive facility location problem on a tree network with stochastic weights.
• Relaxation of the Condorcet and Simpson conditions in voting location
• Competitive location on a network
• Improved algorithms for some competitive location centroid problems on paths, trees and graphs
• The tolerant Condorcet points
• Location of an obnoxious facility on a network: A voting approach
• Democratic elections and centralized decisions: Condorcet and approval voting compared with median and coverage locations
• scientific article; zbMATH DE number 4199949 (Why is no real title available?)
• \((r|p)\)-centroid problems on networks with vertex and edge demand
• Condorcet winner configurations of linear networks
• On discrete optimization with ordering
• scientific article; zbMATH DE number 44763 (Why is no real title available?)
• scientific article; zbMATH DE number 1038420 (Why is no real title available?)
• Simpson Points in Planar Problems with Locational Constraints. The Polyhedral-Gauge Case
• Sequential competitive location on networks
• On condorcet and median points of simple rectilinear polygons
• The wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solution
• Conditional Location Problems on Networks and in the Plane
• An improved implementation and analysis of the Diaz and O'Rourke algorithm for finding the Simpson point of a convex polygon
• Optimization-based computation and integration of ordered measures
• Multiple voting location and single voting location on trees
• An exact method for the discrete \((r|p)\)-centroid problem
• Relaxed voting and competitive location under monotonous gain functions on trees
• On competitive sequential location in a network with a decreasing demand intensity

This page was built for publication: Algorithms for Voting and Competitive Location on a Network

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