Two new heuristics for the location set covering problem
type: Item
instance of: scholarly article
title: Two new heuristics for the location set covering problem
zbMATH Open document ID: 0826.90091
DOI: 10.1007/BF02574812
published in: Top
publication date: 1995-07-04T00:00:00Z
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 770253
zbMATH Keywords: greedy-type heuristics
zbMATH Keywords: location set covering
author: Marcos Almiñana
author: Jesus T. Pastor
describes a project that uses: OR-Library
MaRDI profile type: Publication
cites work: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
cites work: Q4735035
cites work: Q5675139
cites work: Worst case analysis of a class of set covering heuristics
cites work: Review, extension and prediction in emergency service siting models
cites work: Computer Solutions to Minimum-Cover Problems
cites work: The Location of Emergency Service Facilities
cites work: An efficient heuristic for large set covering problems
cites work: Hybrid heuristics for minimum cardinality set covering problems
description: scientific article; zbMATH DE number 770253