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 QIDQ2108113FDOQ2108113
Authors: Seyed R. Mousavi 
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
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
local searchmetaheuristic\(p\)-center problemsearch spaceheuristic functionflat subspacemove operation
Cites Work
- TSPLIB—A Traveling Salesman Problem Library
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Solving two location models with few facilities by using a hybrid heuristic: a real health resources case
- The p-center location problem in an area
- Title not available (Why is that?)
- The \(p\)-median problem: a survey of metaheuristic approaches
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Fault tolerant \(K\)-center problems
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- The \(p\)-neighbor \(k\)-center problem
- Robust weighted vertex \(p\)-center model considering uncertain data: an application to emergency management
- A new formulation and resolution method for the \(p\)-center problem
- Double bound method for solving the \(p\)-center location problem
- When centers can fail: a close second opportunity
- Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
- Bee colony optimization for the \(p\)-center problem
- The m-Center 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 maximin gradual cover location problem
- Title not available (Why is that?)
- Comparison of genomic sequences using the Hamming distance
- Lexicographic local search and the \(p\)-center problem.
- Dominant, an algorithm for the \(p\)-center problem.
- A scalable exact algorithm for the vertex \(p\)-center problem
- Optimal algorithms for the \(\alpha\)-neighbor \(p\)-center problem
- The probabilistic \(p\)-center problem: planning service for potential customers
- An adaptive artificial bee colony algorithm for global optimization
- A GRASP algorithm for the closest string problem using a probability-based heuristic
- GRASP and VNS for solving the \(p\)-next center problem
- Regional service coverage modeling
- Mathematical models and search algorithms for the capacitated \(p\)-center problem
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
Uses Software
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)
