Distance weighted voting and a single facility location problem

DOI10.1016/0377-2217(89)90252-XzbMath0672.90042OpenAlexW2054106521MaRDI QIDQ1120459

Rakesh V. Vohra

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0377-2217(89)90252-x

zbMATH Keywords

votingpolynomial algorithmCondorcet point of a networkfacility loationnonlinear location

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Inventory, storage, reservoirs (90B05) Social choice (91B14)

Related Items (2)

An axiomatic characterization of some locations in trees ⋮ Relaxation of the Condorcet and Simpson conditions in voting location

Cites Work

• Networks with Condorcet solutions
• Optimal Locations for a Class of Nonlinear, Single-Facility Location Problems on a Network

This page was built for publication: Distance weighted voting and a single facility location problem