A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric
From MaRDI portal
Publication:2267315
DOI10.1007/s10479-009-0641-1zbMath1181.90285OpenAlexW2153907106MaRDI QIDQ2267315
Publication date: 1 March 2010
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.379.6048
Minimax problems in mathematical programming (90C47) Abstract computational complexity for mathematical programming problems (90C60) Applications of game theory (91A80)
Related Items (5)
Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks ⋮ Upgrading the 1-center problem with edge length variables on a tree ⋮ Upgrading min-max spanning tree problem under various cost functions ⋮ The uniform cost reverse 1-centdian location problem on tree networks with edge length reduction ⋮ Up- and downgrading the Euclidean 1-median problem and knapsack Voronoi diagrams
Cites Work
- Linear time algorithms for some separable quadratic programming problems
- Up- and downgrading the 1-center in a network
- Hull properties in location problems
- Modifying edges of a network to obtain short subgraphs
- Approximation algorithms for certain network improvement problems
- Weight reduction problems with certain bottleneck objectives.
- A generalization of Brouwer's fixed point theorem
- Bottleneck Capacity Expansion Problems with General Budget Constraints
- An Algorithm for Large Zero-One Knapsack Problems
- Finding minimum rectilinear distance paths in the presence of barriers
- Maximizing the minimum source-sink path subject to a budget constraint
- Edge Weight Reduction Problems in Directed Acyclic Graphs
- Increasing the Weight of Minimum Spanning Trees
- The network inhibition problem
This page was built for publication: A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric
