A hybrid heuristic for the set covering problem
type: Item
instance of: scholarly article
title: A hybrid heuristic for the set covering problem
zbMATH Open document ID: 1273.90180
author: Shyam Sundar
author: Alok Singh
published in: Operational Research. An International Journal
publication date: 2013-10-22T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6217664
zbMATH Keywords: artificial bee colony algorithm
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: heuristic
zbMATH Keywords: set covering problem
zbMATH Keywords: swarm intelligence
describes a project that uses: ABC
MaRDI profile type: Publication
full work available at URL: s12351-010-0086-y
OpenAlex ID: W2069729403
cites work: An indirect genetic algorithm for set covering problems
cites work: A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
cites work: A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm
cites work: An algorithm for set covering problem
cites work: Q4735035
cites work: A genetic algorithm for the set covering problem
cites work: Enhancing an algorithm for set covering problems
cites work: Logical analysis of numerical data
cites work: A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems
cites work: A Heuristic Method for the Set Covering Problem
cites work: Algorithms for the set covering problem
cites work: A Lagrangian-based heuristic for large-scale set covering problems
cites work: Q4398380
cites work: Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
cites work: An Integer Programming Approach to the Vehicle Scheduling Problem
cites work: Q4198056
cites work: A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem
cites work: A comparative study of artificial bee colony algorithm
cites work: An effective and simple heuristic for the set covering problem
cites work: The Location of Emergency Service Facilities
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.1007/S12351-010-0086-Y
description: scientific article; zbMATH DE number 6217664