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

DOI10.1016/J.DISOPT.2018.02.002zbMATH Open1506.90143OpenAlexW2795933202WikidataQ130028235 ScholiaQ130028235MaRDI QIDQ1662640FDOQ1662640

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

Recommendations

• Reverse 1-center problem on weighted trees
• Inverse 1-center location problems with edge length augmentation on trees
• Up- and downgrading the 1-center in a network
• Reverse 1-centre problem on trees under convex piecewise-linear cost function
• Combinatorial algorithms for the uniform-cost inverse 1-center problem on weighted trees

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)

Cites Work

• Approximation algorithms for certain network improvement problems
• Title not available (Why is that?)
• The inverse 1-maxian problem with edge length modification
• Up- and downgrading the 1-center in a network
• 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
• Increasing the Weight of Minimum Spanning Trees
• The network inhibition problem
• Some reverse location problems
• A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric
• Modifying edges of a network to obtain short subgraphs
• Edge Weight Reduction Problems in Directed Acyclic Graphs
• Upgrading \(p\)-median problem on a path
• Title not available (Why is that?)
• Upgrading min-max spanning tree problem under various cost functions

Cited In (10)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662640)