Obnoxious Facility Location on Graphs
From MaRDI portal
Recommendations
Cited in
(82)- A polynomial method for the pos/neg weighted 3-median problem on a tree
- Integer-friendly formulations for the \(r\)-separation problem
- Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem
- Approximation algorithms for maximum dispersion
- Compact location problems
- Discrete facility location and routing of obnoxious activities.
- The obnoxious center problem on weighted cactus graphs.
- 2-medians in trees with pos/neg weights
- Approximation algorithms for maximum linear arrangement
- Approximating the maximum quadratic assignment problem
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
- Center problems with pos/neg weights on trees
- A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks
- Finding a core of a tree with pos/neg weight
- A linear time approximation scheme for computing geometric maximum \(k\)-star
- Approximation randomized strategy-proof mechanisms in obnoxious facility game with weighted agents
- Parallel iterative solution-based tabu search for the obnoxious \(p\)-median problem
- Dispersing obnoxious facilities on a graph
- Continuous facility location on graphs
- Approximability of the dispersed \(\vec{p}\)-neighbor \(k\)-supplier problem
- The 2-maxian problem on cactus graphs
- A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks
- Efficient algorithms for center problems in cactus networks
- The minimum weighted covering location problem with distance constraints
- Locating a semi-obnoxious facility with expropriation
- An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs
- The p-maxian problem on a tree
- Public facility location using dispersion, population, and equity criteria
- Locating two obnoxious facilities using the weighted maximin criterion
- On the unified dispersion problem: efficient formulations and exact algorithms
- A survey on approximation mechanism design without money for facility games
- A modified optimal algorithm for 2-Maxian location problems on cactus graphs
- Obnoxious Centers in Graphs
- Strategy-proof mechanism for obnoxious facility location on a line
- Advanced greedy randomized adaptive search procedure for the obnoxious p-median problem
- Condorcet winner configurations of linear networks
- Strategy-proof approximation mechanisms for an obnoxious facility game on networks
- Probabilistic single obnoxious facility location with fixed budget
- Locating an obnoxious facility on a euclidean network to minimize neighborhood damage
- Minimum-diameter covering problems
- Geometric Packing under Nonuniform Constraints
- scientific article; zbMATH DE number 2111731 (Why is no real title available?)
- An iterated local search for the budget constrained generalized maximal covering location problem
- Facility dispersion and remote subgraphs
- Dispersing Obnoxious Facilities on a Graph
- The pos/neg-weighted 2-medians in balanced trees with subtree-shaped customers
- Location Of A Tree Shaped Facility In A Network
- The Location of Undesirable Facilities
- OBNOXIOUS FACILITY LOCATION: THE CASE OF WEIGHTED DEMAND POINTS
- Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
- The maximum linear arrangement problem for trees under projectivity and planarity
- scientific article; zbMATH DE number 7746263 (Why is no real title available?)
- The \(p\)-Maxian problem on interval graphs
- A parallel variable neighborhood search approach for the obnoxious p‐median problem
- The multi-facility median problem with Pos/Neg weights on general graphs
- Obnoxious facility location in multiple dimensional space
- A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools
- A matheuristic for locating obnoxious facilities
- Selectively closing recycling centers in Bavaria: reforming waste-management policy to reduce disparity
- Dispersion problem on a convex polygon
- An iterated greedy algorithm with variable reconstruction size for the obnoxious \(p\)-median problem
- The obnoxious facilities p-center problem with forbidden regions
- From metric to general graphs: FPT constant-factor approximation algorithms for three location problems
- Maximin and maxisum network location problems with various metrics and minimum distance constraints
- Approximating -covering
- Fifty years of location theory -- a selective review
- Metric distortion of obnoxious distributed voting
- The \(p\)-maxian problem on block graphs
- Approximation strategy-proof mechanisms for obnoxious facility location on a line
- Diverse data selection under fairness constraints
- Algorithms for k-dispersion for points in convex position in the plane
- From Chinese postman to salesman and beyond: shortest tour -covering all points on all edges
- When far is better: the Chamberlin-Courant approach to obnoxious committee selection
- Independence and domination on bounded-treewidth graphs: integer, rational, and irrational distances
- Maximizing the number of obnoxious facilities to locate within a bounded region
- Maximum linear arrangement: exact algorithms for specific classes of graphs and approximation algorithms for wide classes of graphs
- A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint
- Undesirable facility location problems on multicriteria networks
- An \(O(mn)\) algorithm for the anti-cent-dian problem
- A branch-and-cut method for the obnoxious \(p\)-median problem
- The inverse 1-maxian problem with edge length modification
- Location of a facility minimizing nuisance to or from a planar network
This page was built for publication: Obnoxious Facility Location on Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3985539)
