Algorithms for path medi-centers of a tree
From MaRDI portal
Publication:1819243
DOI10.1016/S0305-0548(99)00042-8zbMath0967.90064MaRDI QIDQ1819243
Publication date: 5 January 2000
Published in: Computers \& Operations Research (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Management decision making, including multiple objectives (90B50) Discrete location and assignment (90B80)
Related Items (17)
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 ⋮ Extensive facility location problems on networks: an updated review ⋮ An improved algorithm for the minmax regret path centdian problem on trees ⋮ Revisiting \(k\)-sum optimization ⋮ Finding a core of a tree with pos/neg weight ⋮ Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem ⋮ Finding an optimal core on a tree network with M/G/c/c state-dependent queues ⋮ Range minimization problems in path-facility location on trees ⋮ The continuous and discrete path‐variance problems on trees ⋮ Algorithms for connected \(p\)-centdian problem on block graphs ⋮ Evolutionary design of oriented-tree networks using Cayley-type encodings ⋮ An algorithm for solving the bi-objective median path-shaped facility on a tree network ⋮ Extensive facility location problems on networks with equity measures ⋮ Minimax regret path location on trees ⋮ The centdian subtree on tree networks
This page was built for publication: Algorithms for path medi-centers of a tree
