Pages that link to "Item:Q1579481"

The following pages link to A note on the location of an obnoxious facility on a network (Q1579481):

Displaying 11 items.

• An iterated local search for the budget constrained generalized maximal covering location problem (Q483216) (← links)
• Approximation strategy-proof mechanisms for obnoxious facility location on a line (Q721939) (← links)
• Undesirable facility location problems on multicriteria networks (Q853902) (← links)
• Solving the semi-desirable facility location problem using bi-objective particle swarm (Q856268) (← links)
• An \(O(mn)\) algorithm for the anti-cent-dian problem (Q864778) (← links)
• The obnoxious center problem on weighted cactus graphs. (Q1427192) (← links)
• A new bound and an \(O(mn)\) algorithm for the undesirable 1-median problem (maxian) on networks (Q1885943) (← links)
• The minimum weighted covering location problem with distance constraints (Q2384883) (← links)
• The β-reliable minimax and maximin location problems on a network with probabilistic weights (Q3057136) (← links)
• Strategy-Proof Mechanism for Obnoxious Facility Location on a Line (Q3196371) (← links)
• The Location of Undesirable Facilities (Q5506725) (← links)