Corpus ID: 18292372

Up- and downgrading the 1-median in a network

@inproceedings{Gassner2008UpAD,
  title={Up- and downgrading the 1-median in a network},
  author={Elisabeth Gassner},
  year={2008}
}
  • Elisabeth Gassner
  • Published 2008
  • Mathematics
  • While classical location problems deal with finding optimal locations for facilities, the task of the corresponding upgrading (downgrading) version is to change the underlying network within certain bounds such that the optimal objective value that can be obtained in the modified network is as good (bad) as possible. In this paper we allow to change the vertex weights within given bounds such that a linear budget constraint is satisfied. For the upgrading 1-median problem an O(n) time algorithm… CONTINUE READING
    5 Citations

    Figures from this paper

    Up- and downgrading the euclidean 1-median problem and knapsack Voronoi diagrams
    • F. Plastria
    • Mathematics, Computer Science
    • Ann. Oper. Res.
    • 2016
    • 2
    A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric
    • 5
    • PDF
    Upgrading p-Median Problem on a Path
    • 3
    Upgrading min-max spanning tree problem under various cost functions
    • 2

    References

    SHOWING 1-10 OF 35 REFERENCES
    Up- and downgrading the 1-center in a network
    • 11
    • PDF
    Inverse median problems
    • 74
    Approximation Algorithms for Certain Network Improvement Problems
    • 45
    A Network Improvement Problem Under Different Norms
    • 19
    Optimal Center Location in Simple Networks
    • 368
    Modifying Edges of a Network to Obtain Short Subgraphs
    • 39
    Reverse 2-median problem on trees
    • 18
    • PDF
    Inapproximability and a polynomially solvable special case of a network improvement problem
    • 13
    • PDF
    Increasing the weight of minimum spanning trees
    • 99