Using a facility location algorithm to solve large set covering problems
type: Item
instance of: scholarly article
title: Using a facility location algorithm to solve large set covering problems
zbMATH Open document ID: 0543.90084
DOI: 10.1016/0167-6377(84)90047-6
author: Francis J. Vasko
author: George R. Wilson
published in: Operations Research Letters
publication date: 1984-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3865000
zbMATH Keywords: large-scale problems
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: uncapacitated facility location problem
zbMATH Keywords: set covering
zbMATH Keywords: heuristic algorithm
MaRDI profile type: Publication
full work available at URL: 0167-6377(84)90047-6
OpenAlex ID: W2051373514
cites work: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
cites work: A Dual-Based Procedure for Uncapacitated Facility Location
cites work: Worst case analysis of a class of set covering heuristics
cites work: Q4142699
cites work: Computer Solutions to Minimum-Cover Problems
cites work: An efficient heuristic for large set covering problems
description: scientific article; zbMATH DE number 3865000