Medi-Centers of a Tree

DOI10.1287/TRSC.19.3.246MaRDI QIDQ3755207zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Algorithms for path medi-centers of a tree
• Locating A Median Subtree On A Network
• The centdian subtree on tree networks
• An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree
• From the median to the generalized center

Cited in

(40)

• scientific article; zbMATH DE number 3950165 (Why is no real title available?)
• The connected \(p\)-centdian problem on block graphs
• Axiomatic considerations in multi-objective location theory
• Multiobjective analysis of facility location decisions
• Minisum location problems in directed networks
• A computational study of minimax flow centers in trees
• Group centre and group median of a tree
• The extensive 1-median problem with radius on networks
• Improved complexity results for several multifacility location problems on trees
• The obnoxious \(p\) facility network location problem with facility interaction
• Worst-case incremental analysis for a class ofp-facility location problems
• The location of central structures in trees
• scientific article; zbMATH DE number 4085448 (Why is no real title available?)
• On Parametric Medians of Trees
• On different ``middle parts of a tree
• The centdian subtree on tree networks
• Comments on ‘Facility location problem on network under multiple criteria fuzzy set theoretic approach’
• The cendian of a tree
• Group centre and group median of a network
• The zone-constrained location problem on a network
• Locating the median of a tree in real time
• Revisiting \(k\)-sum optimization
• A multicriteria approach to the location of public facilities
• An Optimal Algorithm for Weighted Minimax Flow Centers on Trees
• The 2-radius and 2-radiian problems on trees
• Reducibility of minimax to minisum 0-1 programming problems
• Centers of a dendroid
• Algorithms for connected \(p\)-centdian problem on block graphs
• Location analysis: a synthesis and survey
• Algorithms for central-median paths with bounded length on trees
• A geometrical solution for quadratic bicriteria location models
• From the median to the generalized center
• The least element property of center location on tree networks with applications to distance and precedence constrained problems
• An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree
• Distributed algorithms for finding centers and medians in networks
• Minimizing the sum of the \(k\) largest functions in linear time.
• The weighted center and weighted median of network location
• A polynomial algorithm for the multicriteria cent-dian location problem
• Review of obnoxious facilities location problems
• Comparative error bound theory for three location models: continuous demand versus discrete demand

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3755207)