On the Fractional Solution to the Set Covering Problem
From MaRDI portal
Publication:3668305
DOI10.1137/0604023zbMath0518.90055MaRDI QIDQ3668305
Publication date: 1983
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0604023
gap; set covering; linear programming relaxation; worst case analysis; fractional optimal value; zero- one optimal value
90C32: Fractional programming
90C05: Linear programming
05A05: Permutations, words, matrices
90C09: Boolean programming
Related Items
Randomized approximation of bounded multicovering problems, Bibliography on domination in graphs and some basic definitions of domination parameters, A unified approximation algorithm for node-deletion problems, Matchings and covers in hypergraphs
Cites Work