Simpson Points in Planar Problems with Locational Constraints. The Polyhedral-Gauge Case
From MaRDI portal
Publication:4346224
DOI10.1287/moor.22.2.291zbMath0883.90076OpenAlexW2086603595MaRDI QIDQ4346224
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.291
Convex programming (90C25) Voting theory (91B12) Discrete location and assignment (90B80) Social choice (91B14)
Related Items
A generalized Weber problem with different gauges for different regions, The discrete facility location problem with balanced allocation of customers, A variational inequality approach for constrained multifacility Weber problem under gauge, Quasiconvex constrained multicriteria continuous location problems: structure of nondominated solution sets, A comparison of formulations and solution methods for the minimum-envy location problem, An ADMM-based location-allocation algorithm for nonconvex constrained multi-source Weber problem under gauge, Asymmetric distances, semidirected networks and majority in Fermat-Weber problems, A heuristic algorithm for constrained multi-source location problem with closest distance under gauge: the variational inequality approach, ADMM-type methods for generalized multi-facility Weber problem, 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
