An Axiomatic Approach to Location on Networks

From MaRDI portal
Publication:3202132

DOI10.1287/moor.15.3.553zbMath0715.90070OpenAlexW2117587378MaRDI QIDQ3202132

Ron Holzman

Publication date: 1990

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

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




Related Items (25)

Axiomatic characterization of the median function of a block graphAn ABC-problem for location and consensus functions on graphsThe median function on Boolean latticesAxiomatization and the antimean function on pathsInverse stable point problem on trees under an extension of Chebyshev norm and Bottleneck Hamming distanceA double annealing algorithm for discrete location/allocation problemsThe median function of a block graph: axiomatic characterizationsThe replacement principle for the provision of multiple public goods on tree networksAxioms for consensus functions on the \(n\)-cubeAXIOMATIC CHARACTERIZATION OF THE ANTIMEDIAN FUNCTION ON PATHS AND HYPERCUBESThe ℓp‐function on treesThe center function on treesAxiomatic characterization of the center function. The case of non-universal axiomsAn axiomatization of the median procedure on the \(n\)-cubeMajority rule for profiles of arbitrary length, with an emphasis on the consistency axiomAXIOMATIC CHARACTERIZATION OF THE MEAN FUNCTION ON TREESAn axiomatic characterization of some locations in treesThe ℓp-function on finite Boolean latticesSome personal views on the current state and the future of locational analysisThe replacement principle and tree structured preferencesWhat Do Trees and Hypercubes Have in Common?Five axioms for location functions on median graphsTHE MEDIAN FUNCTION ON TREESAxiomatic characterization of the center function. the case of universal axiomsAxiomatic characterization of the median and antimedian function on a complete graph minus a matching




This page was built for publication: An Axiomatic Approach to Location on Networks