The minimax multistop location problem on a tree (Q3787757)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4051311
Language Label Description Also known as
default for all languages
No label defined
    English
    The minimax multistop location problem on a tree
    scientific article; zbMATH DE number 4051311

      Statements

      The minimax multistop location problem on a tree (English)
      0 references
      0 references
      0 references
      0 references
      0 references
      1988
      0 references
      minimax multistop location
      0 references
      p-center
      0 references
      tree
      0 references
      minimal subtree
      0 references
      efficient solutions
      0 references
      Let T be a tree with edges of positive length which are assumed to be rectifiable. Denote by A(T) the continuum set of points on the edges of T. For a finite subset X of A(T) let T(X) be the minimal subtree containing X and L(T(X)) be the sum of all edges of T(X). Then for a collection F of subsets of V the following problem is considered: find a point \(x\in A(T)\) which minimizes the function \[ f(x)=\max_{S\in F}\{w_ S(L(T(S\cup \{u\})))\} \] where \(w_ S\) are positive weights associated with the sets \(S\in F\). For certain weight functions \(w_ S\) and collections F efficient solutions for this problem are presented.
      0 references

      Identifiers