A parallel variable neighborhood search approach for the obnoxious p‐median problem
From MaRDI portal
Publication:6088247
DOI10.1111/itor.12510OpenAlexW2790589909MaRDI QIDQ6088247
Unnamed Author, Alberto Herrán, Abraham Duarte, Rafael Martí
Publication date: 16 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12510
Related Items
Minimal covering unrestricted location of obnoxious facilities: bi-objective formulation and a case study, Review of obnoxious facilities location problems, 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, Variable neighborhood search: the power of change and simplicity, An efficient variable neighborhood search for the space-free multi-row facility layout problem, Parallel iterative solution-based Tabu search for the obnoxious \(p\)-median problem
Cites Work
- Unnamed Item
- Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem
- A branch-and-cut method for the obnoxious \(p\)-median problem
- Variable neighbourhood search: methods and applications
- Variable neighbourhood search: Methods and applications
- Analytical models for locating undesirable facilities
- Algorithms for job scheduling problems with distinct time windows and general earliness/tardiness penalties
- A fast two-level variable neighborhood search for the clustered vehicle routing problem
- Solving the maximum min-sum dispersion by alternating formulations of two different problems
- The parallel variable neighborhood search for the \(p\)-median problem
- Solving dynamic memory allocation problems in embedded systems with parallel variable neighborhood search strategies
- Obnoxious Facility Location on Graphs
- Markov Chains
- Parallel variable neighborhood search for the min–max order batching problem
- Parallel variable neighbourhood search strategies for the cutwidth minimization problem
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Variable neighborhood search: Principles and applications
