Pages that link to "Item:Q3985539"

The following pages link to Obnoxious Facility Location on Graphs (Q3985539):

Displaying 50 items.

• Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem (Q322911) (← links)
• Strategy-proof approximation mechanisms for an obnoxious facility game on networks (Q391236) (← links)
• Probabilistic single obnoxious facility location with fixed budget (Q413284) (← links)
• An iterated local search for the budget constrained generalized maximal covering location problem (Q483216) (← links)
• The pos/neg-weighted 2-medians in balanced trees with subtree-shaped customers (Q519220) (← links)
• The \(p\)-Maxian problem on interval graphs (Q608284) (← links)
• The multi-facility median problem with Pos/Neg weights on general graphs (Q609818) (← links)
• The \(p\)-maxian problem on block graphs (Q711397) (← links)
• Approximation strategy-proof mechanisms for obnoxious facility location on a line (Q721939) (← links)
• Maximizing the number of obnoxious facilities to locate within a bounded region (Q733537) (← links)
• A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint (Q830937) (← links)
• Undesirable facility location problems on multicriteria networks (Q853902) (← links)
• An \(O(mn)\) algorithm for the anti-cent-dian problem (Q864778) (← links)
• A branch-and-cut method for the obnoxious \(p\)-median problem (Q926563) (← links)
• The inverse 1-maxian problem with edge length modification (Q941835) (← links)
• Location of a facility minimizing nuisance to or from a planar network (Q947950) (← links)
• A polynomial method for the pos/neg weighted 3-median problem on a tree (Q1006548) (← links)
• Integer-friendly formulations for the \(r\)-separation problem (Q1268268) (← links)
• Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem (Q1270784) (← links)
• The obnoxious \(p\) facility network location problem with facility interaction (Q1291604) (← links)
• Approximation algorithms for maximum dispersion (Q1375119) (← links)
• Compact location problems (Q1391322) (← links)
• Discrete facility location and routing of obnoxious activities. (Q1417557) (← links)
• The obnoxious center problem on weighted cactus graphs. (Q1427192) (← links)
• 2-medians in trees with pos/neg weights (Q1582068) (← links)
• Approximation algorithms for maximum linear arrangement (Q1603380) (← links)
• Approximating the maximum quadratic assignment problem (Q1607075) (← links)
• A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (Q1631680) (← links)
• Center problems with pos/neg weights on trees (Q1869485) (← links)
• A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks (Q1885943) (← links)
• Finding a core of a tree with pos/neg weight (Q1935945) (← links)
• A linear time approximation scheme for computing geometric maximum \(k\)-star (Q1942028) (← links)
• Approximation randomized strategy-proof mechanisms in obnoxious facility game with weighted agents (Q2014050) (← links)
• Parallel iterative solution-based Tabu search for the obnoxious \(p\)-median problem (Q2027024) (← links)
• Dispersing obnoxious facilities on a graph (Q2032349) (← links)
• Continuous facility location on graphs (Q2118124) (← links)
• Approximability of the dispersed \(\vec{p}\)-neighbor \(k\)-supplier problem (Q2217474) (← links)
• The 2-maxian problem on cactus graphs (Q2339821) (← links)
• A strongly polynomial algorithm for minimum convex separable quadratic cost flow problems on two-terminal series-parallel networks (Q2366611) (← links)
• Efficient algorithms for center problems in cactus networks (Q2371802) (← links)
• The minimum weighted covering location problem with distance constraints (Q2384883) (← links)
• Locating a semi-obnoxious facility with expropriation (Q2384885) (← links)
• An improved analysis for a greedy remote-clique algorithm using factor-revealing LPs (Q2391186) (← links)
• The \(p\)-maxian problem on a tree (Q2467473) (← links)
• Public facility location using dispersion, population, and equity criteria (Q2514787) (← links)
• Locating two obnoxious facilities using the weighted maximin criterion (Q2583716) (← links)
• On the unified dispersion problem: efficient formulations and exact algorithms (Q2629707) (← links)
• A Survey on Approximation Mechanism Design Without Money for Facility Games (Q2942465) (← links)
• A modified optimal algorithm for 2-maxian location problems on cactus graphs (Q2979777) (← links)
• Obnoxious Centers in Graphs (Q3013158) (← links)