On the Greedy Heuristic for Continuous Covering and Packing Problems

Publisher Website

1 December 1982

journal article
Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods

Vol. 3 (4) , 584-591
https://doi.org/10.1137/0603059

Abstract

No abstract available

All Related Versions

Version 1, RePEc (Unconfirmed version)

This publication has 7 references indexed in Scilit:

Approximation algorithms for combinatorial problems
Published by Elsevier ,2007
Worst-Case Analysis of Heuristic Algorithms
Management Science, 1980
Heuristic analysis, linear programming and branch and bound
Published by Springer Nature ,1980
A Greedy Heuristic for the Set-Covering Problem
Mathematics of Operations Research, 1979
An analysis of approximations for maximizing submodular set functions—I
Mathematical Programming, 1978
Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
Management Science, 1977
On the ratio of optimal integral and fractional covers
Discrete Mathematics, 1975