Enumeration technique for set covering problems: a combinatorial approach

DOI10.1080/09720502.2006.10700454zbMath1149.90377OpenAlexW2094438744MaRDI QIDQ5756413

Ratnesh Rajan Saxena

Publication date: 4 September 2007

Published in: Journal of Interdisciplinary Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720502.2006.10700454

zbMATH Keywords

multi-objective programminginteger programming problemscombinatroics

Mathematics Subject Classification ID

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

Cites Work

• A Greedy Heuristic for the Set-Covering Problem
• Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems

This page was built for publication: Enumeration technique for set covering problems: a combinatorial approach