An electromagnetism metaheuristic for the unicost set covering problem
type: Item
instance of: scholarly article
title: An electromagnetism metaheuristic for the unicost set covering problem
zbMATH Open document ID: 1188.90218
author: Zahra Naji-Azimi
author: Paolo Toth
author: Laura Galli
published in: European Journal of Operational Research
publication date: 2010-06-11T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5720397
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: unicost set covering problem
zbMATH Keywords: electromagnetism metaheuristic
describes a project that uses: OR-Library
MaRDI profile type: Publication
full work available at URL: j.ejor.2010.01.035
OpenAlex ID: W2034107192
cites work: An indirect genetic algorithm for set covering problems
cites work: A GRASP algorithm to solve the unicost set covering problem
cites work: An algorithm for set covering problem
cites work: A genetic algorithm for the set covering problem
cites work: An electromagnetism-like mechanism for global optimization
cites work: Algorithms for railway crew management
cites work: A Heuristic Method for the Set Covering Problem
cites work: Algorithms for the set covering problem
cites work: Q3500142
cites work: Q4398380
cites work: A hybrid scatter search/electromagnetism meta-heuristic for project scheduling
cites work: Q4198056
cites work: A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem
cites work: An effective and simple heuristic for the set covering problem
cites work: Q5488956
cites work: A parallel genetic algorithm to solve the set-covering problem
cites work: RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
cites work: A 3-flip neighborhood local search for the set covering problem
DOI: 10.1016/J.EJOR.2010.01.035
description: scientific article; zbMATH DE number 5720397