Optimal approaches for upgrading selective obnoxious p-median location problems on tree networks

DOI10.1007/S10479-020-03561-4MaRDI QIDQ2158608zbMATH OpenOpenAlexFDO

Authors Esmaeil Afrashteh, Behrooz Alizadeh, Fahimeh Baroughi

Publication date 26 July 2022

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-020-03561-4

zbMATH Keywords

combinatorial optimizationtime complexitytree graphsupgrading problemobnoxious \(p\)-median location

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Recommendations

• Reverse selective obnoxious center location problems on tree graphs
• Optimal algorithms for selective variants of the classical and inverse median location problems on trees
• Upgrading \(p\)-median problem on a path
• Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
• Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms

Cites work

• scientific article; zbMATH DE number 1091317 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric
• A linear time algorithm for inverse obnoxious center location problems on networks
• An Algorithm for Large Zero-One Knapsack Problems
• Approximation algorithms for certain network improvement problems
• Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs
• Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
• Discrete facility location and routing of obnoxious activities.
• Edge Weight Reduction Problems in Directed Acyclic Graphs
• Increasing the Weight of Minimum Spanning Trees
• Introduction to algorithms
• Inverse 1-center location problems with edge length augmentation on trees
• Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms
• Linear time optimal approaches for reverse obnoxious center location problems on networks
• Maximizing the minimum source-sink path subject to a budget constraint
• Modifying edges of a network to obtain short subgraphs
• Optimal algorithms for inverse vertex obnoxious center location problems on graphs
• Reverse selective obnoxious center location problems on tree graphs
• The p-maxian problem on a tree
• The inverse 1-maxian problem with edge length modification
• The inverse \(p\)-maxian problem on trees with variable edge lengths
• Up- and downgrading the 1-center in a network
• Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams
• Upgrading \(p\)-median problem on a path
• Upgrading the 1-center problem with edge length variables on a tree
• Upgrading trees under diameter and budget constraints
• Weight reduction problems with certain bottleneck objectives.

Cited in

(9)

• Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
• Optimal algorithms for selective variants of the classical and inverse median location problems on trees
• 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
• Reverse selective obnoxious center location problems on tree graphs
• Upgrading \(p\)-median problem on a path
• On the complexity of the upgrading version of the maximal covering location problem

This page was built for publication: Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks

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