VNS heuristic for the (r|p)-centroid problem on the plane
From MaRDI portal
Publication:2840744
Recommendations
- A local search heuristic for the \((r| p)\)-centroid problem in the plane
- A new alternating heuristic for the \((r|p)\)-centroid problem on the plane
- On the complexity of the \((r|p)\)-centroid problem in the plane
- Fast metaheuristics for the discrete \((r|p)\)-centroid problem
- A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
Cites work
- A new alternating heuristic for the \((r|p)\)-centroid problem on the plane
- An alternating heuristic for medianoid and centroid problems in the plane
- On locating new facilities in a competitive environment
- On the complexity of the \((r|p)\)-centroid problem in the plane
- Sequential competitive location on networks
- Variable neighborhood search: Principles and applications
Cited in
(12)- A bilevel planning model for public-private partnership
- Comparison of models of planning public-private partnership
- VNS heuristic
- The \((1 | 1)\)-centroid problem in the plane with distance constraints
- A local search heuristic for the \((r| p)\)-centroid problem in the plane
- On the complexity of the \((r|p)\)-centroid problem in the plane
- Fast metaheuristics for the discrete \((r|p)\)-centroid problem
- A new alternating heuristic for the \((r|p)\)-centroid problem on the plane
- A hybrid genetic algorithm with solution archive for the discrete \((r|p)\)-centroid problem
- Metaheuristics for bilevel optimization: a comprehensive review
- A simple and effective exact method for the medianoid problem with multipurpose trips
- An exact method for the discrete \((r|p)\)-centroid problem
This page was built for publication: VNS heuristic for the \((r|p)\)-centroid problem on the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2840744)
