Pareto optimality and a class of set covering heuristics
type: Item
instance of: scholarly article
title: Pareto optimality and a class of set covering heuristics
zbMATH Open document ID: 0784.90060
DOI: 10.1007/BF02025298
author: Nicholas G. Hall
author: Rakesh V. Vohra
published in: Annals of Operations Research
publication date: 1993-12-20T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 474768
zbMATH Keywords: set covering
zbMATH Keywords: Pareto optimal dual solution
zbMATH Keywords: dual saturation heuristic
zbMATH Keywords: worst-case performance
MaRDI profile type: Publication
cites work: A Sharp Bound on the Ratio Between Optimal Integer and Fractional Covers
cites work: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
cites work: A linear-time approximation algorithm for the weighted vertex cover problem
cites work: Economics for Mathematicians
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: Q4198056
cites work: A fast approximation algorithm for the multicovering problem
cites work: Worst case analysis of a class of set covering heuristics
cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems
cites work: Approximation algorithms for combinatorial problems
full work available at URL: https://doi.org/10.1007/bf02025298
OpenAlex ID: W1986373179
description: scientific article; zbMATH DE number 474768