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

DOI10.1016/J.DISOPT.2018.02.002MaRDI QIDQ1662640zbMATH OpenOpenAlexWikidataFDO

Authors 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)

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

Cites work

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

Cited in

(14)

• Some upgrading problems on networks related to eccentricity concept
• Edge downgrades in the maximal covering location problem
• Optimal approaches for upgrading selective obnoxious p-median location problems on tree networks
• The p-median problem with upgrading of transportation costs and minimum travel time allocation
• 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
• Stability radius and an upgrading model of median location on trees
• Upgrading \(p\)-median problem on a path
• 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)