The obnoxious \(p\) facility network location problem with facility interaction

DOI10.1016/S0377-2217(97)00111-2zbMath0951.90500MaRDI QIDQ1291604

Said Salhi, S. B. Welch

Publication date: 17 December 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

heuristicssimulated annealinglocationobnoxious facility

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (8)

Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study ⋮ Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem ⋮ The Weber obnoxious facility location model: a big arc small arc approach ⋮ Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem ⋮ Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming ⋮ A branch-and-cut method for the obnoxious \(p\)-median problem ⋮ A general model for the undesirable single facility location problem ⋮ The obnoxious \(p\) facility network location problem with facility interaction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Locating an undesirable facility with a minimax criterion
• A branch-and-bound algorithm for the location of facilities causing atmospheric pollution
• The obnoxious \(p\) facility network location problem with facility interaction
• Some experiments with simulated annealing techniques for packing problems
• An Analysis of Network Location Problems with Distance Constraints
• Location of Multiple Obnoxious Facilities
• Medi-Centers of a Tree
• A Maxmin Location Problem
• Single Facility $l_p $-Distance Minimax Location
• Minimax Location of Two Facilities with Minimum Separation: Interactive Graphical Solutions
• Location of Facilities Producing Airborne Pollution
• Finding Minimal Center-Median Convex Combination (Cent-Dian) of a Graph
• Capacitated clustering problems by hybrid simulated annealing and tabu search

This page was built for publication: The obnoxious \(p\) facility network location problem with facility interaction