Optimal approaches for upgrading selective obnoxious p-median location problems on tree networks
From MaRDI portal
(Redirected from Publication:2158608)
Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks
Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks
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
- 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
- scientific article; zbMATH DE number 1091317 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- 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 \(p\)-maxian problem on trees with variable edge lengths
- The inverse 1-maxian problem with edge length modification
- 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
(13)- Upgrading nodes in tree-shaped hub location
- Reverse selective obnoxious center location problems on tree graphs
- Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks
- Upgrading edges in the maximal covering location problem
- Optimal algorithms for selective variants of the classical and inverse median location problems on trees
- Upgrading edges in the graphical TSP
- The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction
- On the complexity of the upgrading version of the maximal covering location problem
- Some upgrading problems on networks related to eccentricity concept
- Edge downgrades in the maximal covering location problem
- Stability radius and an upgrading model of median location on trees
- The covering tour problem with path upgrades
- Upgrading \(p\)-median problem on a path
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)
