From the median to the generalized center

DOI10.1051/ro/1991250100731zbMath0760.90063OpenAlexW1815843955MaRDI QIDQ3971961

Pierre Hansen, Martine Labbé, Jacques-François Thisse

Publication date: 25 June 1992

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/105004

zbMATH Keywords

networktreeassignmentcent-dian problemlocation of a single facility

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (8)

The Connected p-Centdian Problem on Block Graphs ⋮ A polynomial algorithm for the multicriteria cent-dian location problem ⋮ An \(O(mn)\) algorithm for the anti-cent-dian problem ⋮ On discrete optimization with ordering ⋮ Using \(\ell^p\)-norms for fairness in combinatorial optimisation ⋮ Topology of strings: median string is NP-complete ⋮ Ordered weighted average optimization in multiobjective spanning tree problem ⋮ Algorithms for connected \(p\)-centdian problem on block graphs

This page was built for publication: From the median to the generalized center