A Sharp Bound on the Ratio Between Optimal Integer and Fractional Covers

DOI10.1287/moor.9.1.1zbMath0537.90077OpenAlexW2025470215MaRDI QIDQ3323708

Egon Balas

Publication date: 1984

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.9.1.1

zbMATH Keywords

heuristicset coveringbest possible boundoptimal fractional solution

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial aspects of packing and covering (05B40)

Related Items (3)

Rounding algorithms for covering problems ⋮ Hitting times of local and global optima in genetic algorithms with very high selection pressure ⋮ Pareto optimality and a class of set covering heuristics

This page was built for publication: A Sharp Bound on the Ratio Between Optimal Integer and Fractional Covers