Upgrading the 1-center problem with edge length variables on a tree

DOI10.1016/j.disopt.2018.02.002zbMath1506.90143OpenAlexW2795933202WikidataQ130028235 ScholiaQ130028235MaRDI QIDQ1662640

Ali Reza Sepasian

Publication date: 20 August 2018

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2018.02.002

zbMATH Keywords

combinatorial optimizationlocation problems1-center problemupgrading problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (7)

Upgrading nodes in tree-shaped hub location ⋮ Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks ⋮ Upgrading edges in the maximal covering location problem ⋮ Upgrading edges in the graphical TSP ⋮ The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation ⋮ The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction ⋮ The \(p\)-center problem under locational uncertainty of demand points

Cites Work

• Upgrading \(p\)-median problem on a path
• The inverse 1-maxian problem with edge length modification
• Up- and downgrading the 1-center in a network
• Modifying edges of a network to obtain short subgraphs
• Approximation algorithms for certain network improvement problems
• Some reverse location problems
• Upgrading min-max spanning tree problem under various cost functions
• A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric
• Reverse 1-center problem on weighted trees
• Maximizing the minimum source-sink path subject to a budget constraint
• Improving the location of minimax facilities through network modification
• Edge Weight Reduction Problems in Directed Acyclic Graphs
• Increasing the Weight of Minimum Spanning Trees
• The network inhibition problem
• Unnamed Item
• Unnamed Item

This page was built for publication: Upgrading the 1-center problem with edge length variables on a tree