Upgrading the 1-center problem with edge length variables on a tree
type: Item
instance of: scholarly article
title: Upgrading the 1-center problem with edge length variables on a tree
zbMATH Open document ID: 1506.90143
author: Ali Reza Sepasian
published in: Discrete Optimization
publication date: 2018-08-20T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6920581
zbMATH Keywords: location problems
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: upgrading problems
zbMATH Keywords: 1-center problem
MaRDI profile type: Publication
full work available at URL: j.disopt.2018.02.002
OpenAlex ID: W2795933202
cites work: Maximizing the minimum source-sink path subject to a budget constraint
cites work: Edge Weight Reduction Problems in Directed Acyclic Graphs
cites work: The network inhibition problem
cites work: Up- and downgrading the 1-center in a network
cites work: A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric
cites work: Upgrading \(p\)-median problem on a path
cites work: Modifying edges of a network to obtain short subgraphs
cites work: Increasing the Weight of Minimum Spanning Trees
cites work: Approximation algorithms for certain network improvement problems
cites work: Upgrading min-max spanning tree problem under various cost functions
cites work: The inverse 1-maxian problem with edge length modification
cites work: Q4511232
cites work: Improving the location of minimax facilities through network modification
cites work: Some reverse location problems
cites work: Reverse 1-center problem on weighted trees
cites work: Q3316922
Wikidata QID: Q130028235
DOI: 10.1016/J.DISOPT.2018.02.002
description: scientific article; zbMATH DE number 6920581