Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants
type: Item
instance of: scholarly article
title: Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants
author: Seyed R. Mousavi
published in: Computers \& Operations Research
publication date: 2022-12-19T00:00:00Z
Mathematics Subject Classification ID: 90Bxx
zbMATH DE Number: 7634072
zbMATH Keywords: flat subspace
zbMATH Keywords: heuristic function
zbMATH Keywords: local search
zbMATH Keywords: metaheuristic
zbMATH Keywords: move operation
zbMATH Keywords: \(p\)-center problem
zbMATH Keywords: search space
describes a project that uses: OR-Library
describes a project that uses: TSPLIB
describes a project that uses: MENU-OKF
describes a project that uses: SITATION
describes a project that uses: MOD-DIST
MaRDI profile type: Publication
full work available at URL: j.cor.2022.106023
OpenAlex ID: W4296311509
cites work: When centers can fail: a close second opportunity
cites work: Enhancements to two exact algorithms for solving the vertex \(P\)-center problem
cites work: Double bound method for solving the \(p\)-center location problem
cites work: Dominant, an algorithm for the \(p\)-center problem.
cites work: The \(p\)-neighbor \(k\)-center problem
cites work: New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
cites work: Optimal algorithms for the \(\alpha\)-neighbor \(p\)-center problem
cites work: A scalable exact algorithm for the vertex \(p\)-center problem
cites work: Q4857376
cites work: Bee colony optimization for the \(p\)-center problem
cites work: The maximin gradual cover location problem
cites work: A new formulation and resolution method for the \(p\)-center problem
cites work: Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
cites work: Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
cites work: Lexicographic local search and the \(p\)-center problem.
cites work: An Algorithmic Approach to Network Location Problems. I: Thep-Centers
cites work: Fault tolerant \(K\)-center problems
cites work: Mathematical Models and Search Algorithms for the Capacitated p-Center Problem
cites work: GRASP and VNS for solving the \(p\)-next center problem
cites work: Robust weighted vertex \(p\)-center model considering uncertain data: an application to emergency management
cites work: The probabilistic \(p\)-center problem: planning service for potential customers
cites work: The m-Center Problem
cites work: Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
cites work: The \(p\)-median problem: a survey of metaheuristic approaches
cites work: Q4736889
cites work: A GRASP algorithm for the closest string problem using a probability-based heuristic
cites work: Regional service coverage modeling
cites work: Solving two location models with few facilities by using a hybrid heuristic: a real health resources case
cites work: Comparison of genomic sequences using the Hamming distance
cites work: TSPLIB—A Traveling Salesman Problem Library
cites work: The p-center location problem in an area
cites work: An adaptive artificial bee colony algorithm for global optimization
DOI: 10.1016/J.COR.2022.106023
Recommended article: A local search heuristic for the \((r| p)\)-centroid problem in the plane
Recommended article: Lexicographic local search and the \(p\)-center problem.
Recommended article: Generalized \(p\)-center problems: Complexity results and approximation algorithms
Recommended article: Large-scale local search heuristics for the capacitated vertexp-center problem
Recommended article: Stochastic k-Center and j-Flat-Center Problems
Recommended article: A new formulation and resolution method for the \(p\)-center problem
Recommended article: Un nuevo resultado sobre la complejidad del problema delP-centro
Recommended article: Q4867319
Recommended article: Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
Recommended article: New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
description: scientific article; zbMATH DE number 7634072