A heuristic algorithm for the multi-criteria set-covering problems

DOI10.1016/0893-9659(93)90092-2zbMath0785.90084OpenAlexW1966993984MaRDI QIDQ1312032

Yi-Hsin Liu

Publication date: 20 April 1994

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0893-9659(93)90092-2

zbMATH Keywords

greedy heuristicmulticriteria set-covering

Mathematics Subject Classification ID

Integer programming (90C10) Multi-objective and goal programming (90C29)

Related Items (4)

Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem ⋮ A tolerance function for the multiobjective set covering problem ⋮ An algorithm for approximating the Pareto set of the multiobjective set covering problem ⋮ Solving a fuzzy set-covering problem

Cites Work

• A Greedy Heuristic for the Set-Covering Problem
• Unnamed Item

This page was built for publication: A heuristic algorithm for the multi-criteria set-covering problems