Simpson Points in Planar Problems with Locational Constraints. The Round-Norm Case

DOI10.1287/moor.22.2.276zbMath0883.90075OpenAlexW2066456343MaRDI QIDQ4346223

Eduardo Conde, Emilio Carrizosa, Justo Puerto, Manuel Munoz-Marquez

Publication date: 3 August 1997

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.22.2.276

zbMATH Keywords

locational constraintsSimpson set

Mathematics Subject Classification ID

Convex programming (90C25) Voting theory (91B12) Discrete location and assignment (90B80) Social choice (91B14)

Related Items (4)

Quasiconvex constrained multicriteria continuous location problems: structure of nondominated solution sets ⋮ Efficiency in constrained continuous location ⋮ An improved implementation and analysis of the Diaz and O'Rourke algorithm for finding the Simpson point of a convex polygon ⋮ Relaxation of the Condorcet and Simpson conditions in voting location

This page was built for publication: Simpson Points in Planar Problems with Locational Constraints. The Round-Norm Case