Exploiting flat subspaces in local search for p-center problem and two fault-tolerant variants
From MaRDI portal
Publication:2108113
Recommendations
- A local search heuristic for the \((r| p)\)-centroid problem in the plane
- Lexicographic local search and the \(p\)-center problem.
- Generalized p-center problems: Complexity results and approximation algorithms
- Large-scale local search heuristics for the capacitated vertexp-center problem
- Stochastic \(k\)-center and \(j\)-flat-center problems
- A new formulation and resolution method for the \(p\)-center problem
- Un nuevo resultado sobre la complejidad del problema delP-centro
- scientific article; zbMATH DE number 849074
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
Cites work
- scientific article; zbMATH DE number 2086434 (Why is no real title available?)
- scientific article; zbMATH DE number 821272 (Why is no real title available?)
- A GRASP algorithm for the closest string problem using a probability-based heuristic
- A new formulation and resolution method for the \(p\)-center problem
- A scalable exact algorithm for the vertex \(p\)-center problem
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- An adaptive artificial bee colony algorithm for global optimization
- Bee colony optimization for the \(p\)-center problem
- Comparison of genomic sequences using the Hamming distance
- Dominant, an algorithm for the \(p\)-center problem.
- Double bound method for solving the p-center location problem
- Enhancements to two exact algorithms for solving the vertex P-center problem
- Fault tolerant \(K\)-center problems
- GRASP and VNS for solving the \(p\)-next center problem
- Lexicographic local search and the \(p\)-center problem.
- Mathematical models and search algorithms for the capacitated \(p\)-center problem
- New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
- Optimal algorithms for the \(\alpha\)-neighbor \(p\)-center problem
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Regional service coverage modeling
- 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
- Solving two location models with few facilities by using a hybrid heuristic: a real health resources case
- TSPLIB—A Traveling Salesman Problem Library
- The m-Center Problem
- The \(p\)-median problem: a survey of metaheuristic approaches
- The p-neighbor k-center problem
- The maximin gradual cover location problem
- The p-center location problem in an area
- The probabilistic \(p\)-center problem: planning service for potential customers
- When centers can fail: a close second opportunity
Cited in
(4)- GRASP and VNS for solving the \(p\)-next center problem
- A parallel variable neighborhood search for \(\alpha\)-neighbor facility location problems
- Exact solution approaches for the discrete α‐neighbor p‐center problem
- An iterated greedy algorithm with variable reconstruction size for the obnoxious \(p\)-median problem
This page was built for publication: Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2108113)
