Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem
From MaRDI portal
Publication:322911
DOI10.1016/j.ejor.2016.01.047zbMath1346.90487OpenAlexW2296544043MaRDI QIDQ322911
Peter Greistorfer, Abraham Duarte, Rafael Martí, J. Manuel Colmenar
Publication date: 7 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2016.01.047
Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
The Weber obnoxious facility location model: a big arc small arc approach, Review of obnoxious facilities location problems, Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem, A parallel variable neighborhood search approach for the obnoxious p‐median problem, Dispersing facilities on planar segment and circle amidst repulsion, Alternative formulations for the obnoxious \(p\)-median problem, Parallel iterative solution-based Tabu search for the obnoxious \(p\)-median problem, A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A simple tabu search for warehouse location
- Facility location models for distribution system design
- Solving the semi-desirable facility location problem using bi-objective particle swarm
- The \(p\)-median problem: a survey of metaheuristic approaches
- A branch-and-cut method for the obnoxious \(p\)-median problem
- Multiple criteria facility location problems: a survey
- Determining an optimum location for an undesirable facility in a workroom environment
- Analytical models for locating undesirable facilities
- A probabilistic heuristic for a computationally difficult set covering problem
- Optimization, approximation, and complexity classes
- The obnoxious \(p\) facility network location problem with facility interaction
- Discrete facility location and routing of obnoxious activities.
- Efficient location for a semi-obnoxious facility
- Lagrangean heuristics for location problems
- A hybrid heuristic for the \(p\)-median problem
- A bi-objective modeling approach applied to an urban semi-desirable facility location problem
- Location of a semi-obnoxious facility with elliptic maximin and network minisum objectives
- Locating a semi-obnoxious facility with expropriation
- Locating a semi-obnoxious covering facility with repelling polygonal regions
- The \(p\)-maxian problem on a tree
- A simple filter-and-fan approach to the facility location problem
- Public facility location using dispersion, population, and equity criteria
- Locating two obnoxious facilities using the weighted maximin criterion
- Solving the simple plant location problem by genetic algorithm
- GRASP with path relinking heuristics for the antibandwidth problem
- On the Complexity of Some Common Geometric Location Problems
- Solution methods for thep-median problem: An annotated bibliography
- State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
- Obnoxious Facility Location on Graphs
- A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- Integer Programming: Methods, Uses, Computations
- Locating semi-obnoxious facilities with expropriation: minisum criterion
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
