Bee colony optimization for the \(p\)-center problem
type: Item
instance of: scholarly article
title: Bee colony optimization for the \(p\)-center problem
zbMATH Open document ID: 1208.90103
author: Tatjana Davidović
author: Dušan Ramljak
author: Milica Šelmić
author: Dušan Teodorović
published in: Computers \& Operations Research
publication date: 2011-03-25T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 5870590
zbMATH Keywords: meta-heuristics
zbMATH Keywords: bee colony optimization
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: location analysis
zbMATH Keywords: \(p\)-center problem
describes a project that uses: SITATION
describes a project that uses: MOD-DIST
describes a project that uses: MENU-OKF
describes a project that uses: ABC
MaRDI profile type: Publication
full work available at URL: j.cor.2010.12.002
OpenAlex ID: W1998666917
cites work: Q4452941
cites work: Q5852579
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: The Centers and Medians of a Graph
cites work: A note on solving large p-median problems
cites work: Lexicographic local search and the \(p\)-center problem.
cites work: Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
cites work: Dominant, an algorithm for the \(p\)-center problem.
cites work: Solving two location models with few facilities by using a hybrid heuristic: a real health resources case
cites work: Location analysis: a synthesis and survey
cites work: New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
cites work: Q5480099
cites work: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
cites work: Innovations in swarm intelligence.
cites work: Q3048571
cites work: Q4857376
cites work: An Algorithmic Approach to Network Location Problems. II: Thep-Medians
cites work: Q3358522
cites work: Polynomially bounded algorithms for locatingp-centers on a tree
cites work: Heuristic methods for thep-center problem
DOI: 10.1016/J.COR.2010.12.002
description: scientific article; zbMATH DE number 5870590