Obnoxious Facility Location on Graphs
From MaRDI portal
Publication:3985539
DOI10.1137/0404048zbMath0737.05063OpenAlexW1991657767MaRDI QIDQ3985539
Publication date: 27 June 1992
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0404048
Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05)
Related Items
A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks, A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint, A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks, Efficient algorithms for center problems in cactus networks, A quadratic time exact algorithm for continuous connected 2-facility location problem in trees, On the unified dispersion problem: efficient formulations and exact algorithms, Facility dispersion and remote subgraphs, Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem, The minimum weighted covering location problem with distance constraints, Locating a semi-obnoxious facility with expropriation, Undesirable facility location problems on multicriteria networks, An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs, Strategy-Proof Mechanism for Obnoxious Facility Location on a Line, An \(O(mn)\) algorithm for the anti-cent-dian problem, Approximation algorithms for maximum dispersion, A Survey on Approximation Mechanism Design Without Money for Facility Games, The \(p\)-Maxian problem on interval graphs, The multi-facility median problem with Pos/Neg weights on general graphs, Strategy-proof approximation mechanisms for an obnoxious facility game on networks, Compact location problems, 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, Finding a core of a tree with pos/neg weight, Geometric Packing under Nonuniform Constraints, A parallel variable neighborhood search approach for the obnoxious p‐median problem, Dispersing facilities on planar segment and circle amidst repulsion, Probabilistic single obnoxious facility location with fixed budget, A linear time approximation scheme for computing geometric maximum \(k\)-star, Unnamed Item, A modified optimal algorithm for 2-maxian location problems on cactus graphs, Approximability of the dispersed \(\vec{p}\)-neighbor \(k\)-supplier problem, The obnoxious center problem on weighted cactus graphs., A branch-and-cut method for the obnoxious \(p\)-median problem, An iterated local search for the budget constrained generalized maximal covering location problem, The inverse 1-maxian problem with edge length modification, The \(p\)-maxian problem on a tree, Location of a facility minimizing nuisance to or from a planar network, The pos/neg-weighted 2-medians in balanced trees with subtree-shaped customers, Condorcet winner configurations of linear networks, Approximation randomized strategy-proof mechanisms in obnoxious facility game with weighted agents, The \(p\)-maxian problem on block graphs, Minimum-diameter covering problems, Parallel iterative solution-based Tabu search for the obnoxious \(p\)-median problem, Approximation strategy-proof mechanisms for obnoxious facility location on a line, Dispersing obnoxious facilities on a graph, Public facility location using dispersion, population, and equity criteria, 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, Dispersing Obnoxious Facilities on a Graph, 2-medians in trees with pos/neg weights, The Location of Undesirable Facilities, The 2-maxian problem on cactus graphs, Locating two obnoxious facilities using the weighted maximin criterion, Approximation algorithms for maximum linear arrangement, Approximating the maximum quadratic assignment problem, Center problems with pos/neg weights on trees, Continuous facility location on graphs
