Fast metaheuristics for the discrete (r|p)-centroid problem
From MaRDI portal
Publication:463377
Recommendations
- A local search heuristic for the \((r| p)\)-centroid problem in the plane
- A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
- An exact method for the discrete \((r|p)\)-centroid problem
- A new alternating heuristic for the \((r|p)\)-centroid problem on the plane
- VNS heuristic for the \((r|p)\)-centroid problem on the plane
Cites work
- scientific article; zbMATH DE number 9247 (Why is no real title available?)
- scientific article; zbMATH DE number 1253066 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
- A hybrid heuristic for the \(p\)-median problem
- A local search heuristic for the \((r| p)\)-centroid problem in the plane
- An exact procedure and LP formulations for the leader-follower location problem
- Attraction probabilities in variable neighborhood search
- Facility location: discrete models and local search methods
- Metaheuristics. From design to implementation.
- Multiple voting location and single voting location on trees
- Sequential competitive location on networks
- Solving multifacility Huff location models on networks using variable neighborhood search and multi-start local search metaheuristics
- Tabu search for the discrete \((r| p)\)-centroid problem
- The \(p\)-median problem: a survey of metaheuristic approaches
- Variable neighborhood search
- \((r,p)\)-centroid problems on paths and trees
Cited in
(25)- Comparison of metaheuristics for the bilevel facility location and mill pricing problem
- A hybrid genetic algorithm with solution archive for the discrete \((r|p)\)-centroid problem
- The generalized discrete ‐centroid problem
- A bilevel planning model for public-private partnership
- An exact method for the discrete \((r|p)\)-centroid problem
- Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem
- Metaheuristics for bilevel optimization: a comprehensive review
- Local search with an exponential neighborhood for the servers load balancing problem
- A hybrid algorithm of local search for the heterogeneous fixed fleet vehicle routing problem
- Bilevel competitive facility location and pricing problems
- A hybrid VND method for the split delivery vehicle routing problem
- A kernel search matheuristic to solve the discrete leader-follower location problem
- A new alternating heuristic for the \((r|p)\)-centroid problem on the plane
- Optimal placement of rectangles on a plane with fixed objects
- Nash equilibrium sorting genetic algorithm for simultaneous competitive maximal covering location with multiple players
- Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution
- A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
- VNS heuristic for the \((r|p)\)-centroid problem on the plane
- A local search heuristic for the \((r| p)\)-centroid problem in the plane
- Locating facilities in a competitive environment
- Bilevel optimization: theory, algorithms, applications and a bibliography
- A variable neighborhood search algorithm for the \((r\mid p)\) hub-centroid problem under the price war
- Discrete competitive facility location: modeling and optimization approaches
- A bilevel competitive location and pricing model with nonuniform split of demand
- VNS-based heuristic with an exponential neighborhood for the server load balancing problem
This page was built for publication: Fast metaheuristics for the discrete \((r|p)\)-centroid problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q463377)
