Enumeration technique for set covering problems: a combinatorial approach

DOI10.1080/09720502.2006.10700454MaRDI QIDQ5756413zbMATH OpenOpenAlexFDO

Authors R. R. 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

combinatroicsinteger programming problemsmulti-objective programming

Mathematics Subject Classification ID

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

Recommendations

• Publication:4860677
• Linearization approach to multi objective set covering problem with imprecise nonlinear fractional objectives
• An approach to the solution of the set-covering problem
• Enumeration technique for solving multi-objective quadratic set-covering problem using goal programming
• The multicovering problem

Cites work

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

Cited in

(5)

• Enumeration technique for solving multi-objective quadratic set-covering problem using goal programming
• Linearization approach to multi objective set covering problem with imprecise nonlinear fractional objectives
• Two methods of ordering the covering elements for the solution of the set covering problem
• scientific article; zbMATH DE number 834594 (Why is no real title available?)
• A mixed integer linear program and tabu search approach for the complementary edge covering problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756413)