Up- and downgrading the 1-center in a network
type: Item
instance of: scholarly article
title: Up- and downgrading the 1-center in a network
zbMATH Open document ID: 1163.90710
author: Elisabeth Gassner
published in: European Journal of Operational Research
publication date: 2009-06-29T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5571299
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: location problem
zbMATH Keywords: vertex center
zbMATH Keywords: upgrading
zbMATH Keywords: downgrading
zbMATH Keywords: network improvement
zbMATH Keywords: network modification
zbMATH Keywords: complexity
zbMATH Keywords: tree
MaRDI profile type: Publication
full work available at URL: j.ejor.2008.09.013
OpenAlex ID: W2080160510
cites work: A linear time algorithm for the reverse 1‐median problem on a cycle
cites work: Reverse 2-median problem on trees
cites work: Bottleneck capacity expansion problems with general budget constraints
cites work: Weight reduction problems with certain bottleneck objectives.
cites work: Inverse median problems
cites work: The complexity analysis of the inverse center location problem
cites work: Upgrading trees under diameter and budget constraints
cites work: Modifying edges of a network to obtain short subgraphs
cites work: Q4532026
cites work: Increasing the Weight of Minimum Spanning Trees
cites work: Maximizing the minimum source-sink path subject to a budget constraint
cites work: The inverse 1-maxian problem with edge length modification
cites work: Edge Weight Reduction Problems in Directed Acyclic Graphs
cites work: Q4368728
cites work: Inverse combinatorial optimization: a survey on problems, methods, and results
cites work: An Algorithmic Approach to Network Location Problems. II: Thep-Medians
cites work: Approximation algorithms for certain network improvement problems
cites work: Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
cites work: Q3993417
cites work: Minimizing the sum of the \(k\) largest functions in linear time.
cites work: Network upgrading problems
cites work: The network inhibition problem
cites work: An O(n) algorithm for the linear multiple choice knapsack problem and related problems
cites work: Inapproximability and a polynomially solvable special case of a network improvement problem.
cites work: A network improvement problem under different norms
DOI: 10.1016/J.EJOR.2008.09.013
description: scientific article; zbMATH DE number 5571299