OpenAlex
The bi‐criteria doubly weighted center‐median path problem on a tree
Work
Year: 2006
Type: article
Abstract: Given a tree network T with n nodes, let 𝒫 L be the subset of all discrete paths whose length is bounded above by a prespecified value L . We consider the location of a path‐shaped facility P ∈ 𝒫 L... more
Source: Networks
Cites: 34
Cited by: 16
Related to: 10
FWCI: 2.274
Citation percentile (by year/subfield): 83.8
Open Access status: green