Parallel iterative solution-based Tabu search for the obnoxious \(p\)-median problem
From MaRDI portal
Publication:2027024
DOI10.1016/j.cor.2020.105155OpenAlexW3108071500MaRDI QIDQ2027024
Jin-Kao Hao, Jian Chang, Yang Wang, Li Fang Wang
Publication date: 21 May 2021
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2020.105155
Related Items (4)
Neighborhood decomposition-driven variable neighborhood search for capacitated clustering ⋮ A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment ⋮ A multi-objective linear programming model for scheduling part families and designing a group layout in cellular manufacturing systems ⋮ Multi-wave tabu search for the Boolean quadratic programming problem with generalized upper bound constraints
Uses Software
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
- A note on solving large p-median problems
- Application of facility location modeling constructs to vendor selection problems
- Effective metaheuristic algorithms for the minimum differential dispersion problem
- Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
- Solving the traveling repairman problem with profits: a novel variable neighborhood search approach
- Hashing vectors for tabu search
- SipHash: A Fast Short-Input PRF
- Location of an obnoxious facility on a network: A voting approach
- Obnoxious Facility Location on Graphs
- 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
This page was built for publication: Parallel iterative solution-based Tabu search for the obnoxious \(p\)-median problem
