The continuous and discrete path‐variance problems on trees (Q5191143): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58217245, #quickstatements; #temporary_batch_1711565664090
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Algorithms for path medi-centers of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for central-median paths with bounded length on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of extensive facility location in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The path-variance problem on tree networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On locating path- or tree-shaped facilities on networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equity measurement in facility location analysis: A review and framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for several network location problems with equality measures. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The generalized \(p\)-centdian on network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensive facility location problems on networks with equity measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The bi‐criteria doubly weighted center‐median path problem on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating tree-shaped facilities using the ordered median objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4367277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional location of path and tree shaped facilities on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The centdian subtree on tree networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for a core of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for a Core and k-Tree Core of a Tree / rank
 
Normal rank

Revision as of 19:53, 1 July 2024

scientific article; zbMATH DE number 5587980
Language Label Description Also known as
English
The continuous and discrete path‐variance problems on trees
scientific article; zbMATH DE number 5587980

    Statements

    The continuous and discrete path‐variance problems on trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    28 July 2009
    0 references
    path location
    0 references
    variance criterion
    0 references
    equity measures
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references