Up- and downgrading the 1-center in a network

Elisabeth Gassner

European Journal of Operational Research, 2009, vol. 198, issue 2, 370-377

Abstract: We study budget constrained network improvement and degrading problems based on the vertex 1-center problem on graphs: given a graph with vertex weights and edge lengths the task is to decrease and increase the vertex weights within certain limits such that the optimal 1-center objective value with respect to the new weights is minimized and maximized, respectively. The upgrading (improvement) problem is shown to be solvable in time provided that the distance matrix is given. The downgrading 1-center problem is shown to be strongly -hard on general graphs but can be solved in time on trees. As byproduct we suggest an algorithm that solves the problem of minimizing over the upper envelope of n piecewise linear functions in time where K is the total number of breakpoints.

Keywords: Combinatorial; optimization; Location; problem; Vertex; center; Upgrading; Downgrading; Network; improvement; Network; modification; Complexity; Tree (search for similar items in EconPapers)
Date: 2009
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377-2217(08)00763-7
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:198:y:2009:i:2:p:370-377

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().