An iterated greedy algorithm with variable reconstruction size for the obnoxious \(p\)-median problem
From MaRDI portal
Publication:6609705
DOI10.1111/itor.13340MaRDI QIDQ6609705
Seyed Mousavi, Soni Bhambar, Matthew England
Publication date: 24 September 2024
Published in: International Transactions in Operational Research (Search for Journal in Brave)
\(p\)-median problemfacility locationhybrid metaheuristiciterated greedyobnoxious \(p\)-median problem
Cites Work
- Unnamed Item
- Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem
- The \(p\)-median problem: a survey of metaheuristic approaches
- A branch-and-cut method for the obnoxious \(p\)-median problem
- Analytical models for locating undesirable facilities
- Parallel iterative solution-based Tabu search for the obnoxious \(p\)-median problem
- Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants
- Review of obnoxious facilities location problems
- Solution methods for thep-median problem: An annotated bibliography
- Obnoxious Facility Location on Graphs
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- An iterated greedy algorithm for the planning of yarn‐dyeing boilers
- 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
- An efficient implementation of a VNS heuristic for the weighted fair sequences problem
This page was built for publication: An iterated greedy algorithm with variable reconstruction size for the obnoxious \(p\)-median problem
