An iterated greedy algorithm with variable reconstruction size for the obnoxious p-median problem
From MaRDI portal
(Redirected from An iterated greedy algorithm with variable reconstruction size for the obnoxious p-median problem)
An iterated greedy algorithm with variable reconstruction size for the obnoxious \(p\)-median problem
An iterated greedy algorithm with variable reconstruction size for the obnoxious \(p\)-median problem
Cites work
- A branch-and-cut method for the obnoxious \(p\)-median problem
- A parallel variable neighborhood search approach for the obnoxious p‐median problem
- Advanced greedy randomized adaptive search procedure for the obnoxious p-median problem
- An efficient implementation of a VNS heuristic for the weighted fair sequences problem
- An iterated greedy algorithm for the planning of yarn‐dyeing boilers
- Analytical models for locating undesirable facilities
- Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants
- scientific article; zbMATH DE number 1091317 (Why is no real title available?)
- Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
- Obnoxious Facility Location on Graphs
- Parallel iterative solution-based tabu search for the obnoxious \(p\)-median problem
- Review of obnoxious facilities location problems
- Solution methods for thep-median problem: An annotated bibliography
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- The \(p\)-median problem: a survey of metaheuristic approaches
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)
