Algorithms for path medi-centers of a tree

DOI10.1016/S0305-0548(99)00042-8MaRDI QIDQ1819243zbMATH OpenFDO

Authors Igor Averbakh, Oded Berman

Publication date 5 January 2000

Published in Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

treepathPareto-optimaloptimal locationminimax criteria

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Extremal problems in graph theory (05C35) Discrete location and assignment (90B80)

Recommendations

• Algorithms for central-median paths with bounded length on trees
• scientific article; zbMATH DE number 4094808
• Self-Stabilizing Algorithms for Finding Centers and Medians of Trees
• An algorithm for finding a k-median in a directed tree
• Efficient algorithms for finding <scp>2‐medians</scp> of a tree
• A generalized algorithm for centrality problems on trees
• Algorithms for finding P-centers on a weighted tree (for relatively small P)
• A branch-and-cut algorithm for the median-path problem
• scientific article; zbMATH DE number 4085448
• The median procedure for n-trees

Cited in

(26)

• Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem
• The centdian subtree on tree networks
• scientific article; zbMATH DE number 2081036 (Why is no real title available?)
• Finding an optimal core on a tree network with M/G/c/c state-dependent queues
• The location of central structures in trees
• The continuous and discrete path‐variance problems on trees
• Evolutionary design of oriented-tree networks using Cayley-type encodings
• scientific article; zbMATH DE number 2090005 (Why is no real title available?)
• Medi-Centers of a Tree
• scientific article; zbMATH DE number 4085448 (Why is no real title available?)
• The bi‐criteria doubly weighted center‐median path problem on a tree
• Extensive facility location problems on networks: an updated review
• Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network
• Algorithms for central-median paths with bounded length on trees
• Algorithms for connected \(p\)-centdian problem on block graphs
• Extensive facility location problems on networks with equity measures
• Minimax regret path location on trees
• A polynomial algorithm for the multicriteria cent-dian location problem
• The bi-criteria doubly weighted center-median path problem on a tree
• Range minimization problems in path-facility location on trees
• Finding a core of a tree with pos/neg weight
• An algorithm for solving the bi-objective median path-shaped facility on a tree network
• The connected \(p\)-centdian problem on block graphs
• Finding the conditional location of a median path on a tree
• Revisiting k-sum optimization
• An improved algorithm for the minmax regret path centdian problem on trees

This page was built for publication: Algorithms for path medi-centers of a tree

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