Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants
From MaRDI portal
Publication:2108113
DOI10.1016/j.cor.2022.106023OpenAlexW4296311509MaRDI QIDQ2108113
Publication date: 19 December 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.106023
local searchmetaheuristic\(p\)-center problemsearch spaceheuristic functionflat subspacemove operation
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The \(p\)-neighbor \(k\)-center problem
- Double bound method for solving the \(p\)-center location problem
- When centers can fail: a close second opportunity
- The maximin gradual cover location problem
- Bee colony optimization for the \(p\)-center problem
- Enhancements to two exact algorithms for solving the vertex \(P\)-center problem
- The \(p\)-median problem: a survey of metaheuristic approaches
- New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
- Lexicographic local search and the \(p\)-center problem.
- Fault tolerant \(K\)-center problems
- A scalable exact algorithm for the vertex \(p\)-center problem
- The probabilistic \(p\)-center problem: planning service for potential customers
- GRASP and VNS for solving the \(p\)-next center problem
- An adaptive artificial bee colony algorithm for global optimization
- A GRASP algorithm for the closest string problem using a probability-based heuristic
- Comparison of genomic sequences using the Hamming distance
- Dominant, an algorithm for the \(p\)-center problem.
- Optimal algorithms for the \(\alpha\)-neighbor \(p\)-center problem
- Robust weighted vertex \(p\)-center model considering uncertain data: an application to emergency management
- Regional service coverage modeling
- Solving two location models with few facilities by using a hybrid heuristic: a real health resources case
- A New Formulation and Resolution Method for the p-Center Problem
- Mathematical Models and Search Algorithms for the Capacitated p-Center Problem
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- TSPLIB—A Traveling Salesman Problem Library
- The p-center location problem in an area
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- The m-Center Problem
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication: Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants
