A genetic algorithm for the \(p\)-median problem with pos/neg weights
type: Item
instance of: scholarly article
title: A genetic algorithm for the \(p\)-median problem with pos/neg weights
zbMATH Open document ID: 1105.65066
author: Jafar Fathali
published in: Applied Mathematics and Computation
publication date: 2007-02-19T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5128291
zbMATH Keywords: genetic algorithm
zbMATH Keywords: location theory
zbMATH Keywords: \(p\)-median problem
zbMATH Keywords: obnoxious facilities
zbMATH Keywords: numerical examples
zbMATH Keywords: undirected graph
describes a project that uses: OR-Library
MaRDI profile type: Publication
full work available at URL: j.amc.2006.05.143
OpenAlex ID: W2025974868
cites work: An efficient genetic algorithm for the \(p\)-median problem
cites work: Q3147661
cites work: A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
cites work: 2-medians in trees with pos/neg weights
cites work: An ant colony algorithm for the pos/neg weighted \(p\)-median problem
cites work: A polynomial method for the pos/neg weighted 3-median problem on a tree
cites work: Q4265879
cites work: Sequential location problems
cites work: Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases
cites work: Q4692508
cites work: Variable neighborhood search for the p-median
cites work: An Algorithmic Approach to Network Location Problems. II: Thep-Medians
cites work: Q4367080
cites work: A hybrid heuristic for the \(p\)-median problem
cites work: Q4495496
cites work: An efficient tabu search procedure for the \(p\)-median problem
cites work: Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
cites work: A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
DOI: 10.1016/J.AMC.2006.05.143
description: scientific article; zbMATH DE number 5128291