The continuous p-centre problem: an investigation into variable neighbourhood search with memory
DOI10.1016/J.EJOR.2014.10.006zbMATH Open1339.90204OpenAlexW2061349834MaRDI QIDQ2629705FDOQ2629705
Authors: Abdalla Elshaikh, Said Salhi, Gábor Nagy 
Publication date: 6 July 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.10.006
Recommendations
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem
- Variable neighborhood search: Principles and applications
- The parallel variable neighborhood search for the \(p\)-median problem
- scientific article; zbMATH DE number 6004949
continuous space\(p\)-centre problemadaptive searchelzinga-hearn algorithmvariable neighbourhood search with memory
Approximation methods and heuristics in mathematical programming (90C59) Continuous location (90B85)
Cites Work
- Title not available (Why is that?)
- Efficient Algorithms for the (Weighted) Minimum Circle Problem
- Heuristic Methods for Location-Allocation Problems
- Title not available (Why is that?)
- Variable neighborhood search
- Solution methodologies for the smallest enclosing circle problem
- On the Complexity of Some Common Geometric Location Problems
- Robust weighted vertex \(p\)-center model considering uncertain data: an application to emergency management
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- An efficient general variable neighborhood search for large travelling salesman problem with time windows
- A computational approach for eliminating error in the solution of the location set covering problem
- Enhancements to two exact algorithms for solving the vertex \(P\)-center problem
- New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
- The p-Centre Problem-Heuristic and Optimal Algorithms
- A Note on p-Center Problems in the Plane
- Integrating heuristic information into exact methods: the case of the vertex \(p\)-centre problem
- Solving the continuous space p-centre problem: planning application issues
Cited In (7)
- GRASP and VNS for solving the \(p\)-next center problem
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane
- The capacitated single-source \(p\)-center problem in the presence of fixed cost and multilevel capacities using VNS and aggregation technique
- An adaptive perturbation-based heuristic: an application to the continuous \(p\)-centre problem
- Drezner's exact method for the continuous \(p\)-centre problem revisited
- A new local search for continuous location problems
Uses Software
This page was built for publication: The continuous \(p\)-centre problem: an investigation into variable neighbourhood search with memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2629705)
