Medi-Centers of a Tree

DOI10.1287/trsc.19.3.246zbMath0618.90029OpenAlexW1986251474MaRDI QIDQ3755207

G. Handler

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1287/trsc.19.3.246

zbMATH Keywords

network locationEfficient algorithmslocating a single facility on a treemedi-center

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Related Items (21)

Worst-case incremental analysis for a class ofp-facility location problems ⋮ Multiobjective analysis of facility location decisions ⋮ Axiomatic considerations in multi-objective location theory ⋮ The Connected p-Centdian Problem on Block Graphs ⋮ A polynomial algorithm for the multicriteria cent-dian location problem ⋮ Algorithms for central-median paths with bounded length on trees ⋮ Revisiting \(k\)-sum optimization ⋮ Review of obnoxious facilities location problems ⋮ Comments on ‘Facility location problem on network under multiple criteria fuzzy set theoretic approach’ ⋮ A multicriteria approach to the location of public facilities ⋮ Reducibility of minimax to minisum 0-1 programming problems ⋮ Comparative error bound theory for three location models: continuous demand versus discrete demand ⋮ The 2-radius and 2-radiian problems on trees ⋮ Location analysis: a synthesis and survey ⋮ Algorithms for connected \(p\)-centdian problem on block graphs ⋮ Group centre and group median of a tree ⋮ The obnoxious \(p\) facility network location problem with facility interaction ⋮ A geometrical solution for quadratic bicriteria location models ⋮ Minimizing the sum of the \(k\) largest functions in linear time. ⋮ The centdian subtree on tree networks ⋮ The zone-constrained location problem on a network

This page was built for publication: Medi-Centers of a Tree