An iterated greedy algorithm with variable reconstruction size for the obnoxious p-median problem
From MaRDI portal
Publication:6609705
DOI10.1111/ITOR.13340MaRDI QIDQ6609705FDOQ6609705
Authors: Seyed Mousavi, Soni Bhambar, Matthew England 
Publication date: 24 September 2024
Published in: International Transactions in Operational Research (Search for Journal in Brave)
facility location\(p\)-median problemhybrid metaheuristiciterated greedyobnoxious \(p\)-median problem
Cites Work
- The \(p\)-median problem: a survey of metaheuristic approaches
- Solution methods for thep-median problem: An annotated bibliography
- A branch-and-cut method for the obnoxious \(p\)-median problem
- Analytical models for locating undesirable facilities
- Title not available (Why is that?)
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem
- Obnoxious Facility Location on Graphs
- A parallel variable neighborhood search approach for the obnoxious p‐median problem
- Parallel iterative solution-based tabu search for the obnoxious \(p\)-median problem
- Less is more approach: basic variable neighborhood 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
- An iterated greedy algorithm for the planning of yarn‐dyeing boilers
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6609705)
