On cent-dians of general networks

DOI10.1016/S0966-8349(97)00009-0zbMath0930.90057OpenAlexW2054637808WikidataQ126839111 ScholiaQ126839111MaRDI QIDQ4228770

Włodzimierz Ogryczak

Publication date: 1 March 1999

Published in: Location Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0966-8349(97)00009-0

zbMATH Keywords

medianPareto-optimalitylocation on networkscentrebicriteria modelPareto-optimal compromise locations

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (5)

A polynomial algorithm for the multicriteria cent-dian location problem ⋮ Using \(\ell^p\)-norms for fairness in combinatorial optimisation ⋮ The probabilistic \(p\)-center problem: planning service for potential customers ⋮ Inequality measures and equitable approaches to location problems ⋮ Fair optimization and networks: a survey

This page was built for publication: On cent-dians of general networks