zbMATH — the first resource for mathematics

A heuristic algorithm for the multi-criteria set-covering problems. (English) Zbl 0785.90084
Summary: A simple greedy heuristic algorithm for the multicriteria set-covering problem is presented. This result is a multicriteria generalization of a result established previously by V. Chvatal [Math. Oper. Res. 4, No. 3, 233-235 (1979; Zbl 0443.90066)].

90C29 Multi-objective and goal programming
90C10 Integer programming
Full Text: DOI
[1] Yu, P.L., Multiple-criteria decision making, (1985), Plenum New York, NY · Zbl 0554.92019
[2] Chvatal, V., A greedy heuristic for the set-covering problem, Math of O.R., 4, 3, 233-235, (1979) · Zbl 0443.90066
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.