Optimal approaches for upgrading selective obnoxious p-median location problems on tree networks
DOI10.1007/S10479-020-03561-4zbMATH Open1493.90089OpenAlexW3010912433MaRDI QIDQ2158608FDOQ2158608
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
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
combinatorial optimizationtime complexitytree graphsupgrading problemobnoxious \(p\)-median location
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Introduction to algorithms
- Approximation algorithms for certain network improvement problems
- Upgrading trees under diameter and budget constraints
- Inverse 1-center location problems with edge length augmentation on trees
- A linear time algorithm for inverse obnoxious center location problems on networks
- An Algorithm for Large Zero-One Knapsack Problems
- Discrete facility location and routing of obnoxious activities.
- Title not available (Why is that?)
- The inverse 1-maxian problem with edge length modification
- Up- and downgrading the 1-center in a network
- The \(p\)-maxian problem on a tree
- Maximizing the minimum source-sink path subject to a budget constraint
- Increasing the Weight of Minimum Spanning Trees
- Weight reduction problems with certain bottleneck objectives.
- A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric
- Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams
- The inverse \(p\)-maxian problem on trees with variable edge lengths
- Modifying edges of a network to obtain short subgraphs
- Edge Weight Reduction Problems in Directed Acyclic Graphs
- Upgrading \(p\)-median problem on a path
- Optimal algorithms for inverse vertex obnoxious center location problems on graphs
- Upgrading the 1-center problem with edge length variables on a tree
- Reverse selective obnoxious center location problems on tree graphs
- Linear time optimal approaches for reverse obnoxious center location problems on networks
- 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
- Inverse obnoxious \(p\)-median location problems on trees with edge length modifications under different norms
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)
