Enumeration technique for solving multi-objective quadratic set-covering problem using goal programming

DOI10.1007/s12597-011-0038-1zbMath1254.90098OpenAlexW2041262342MaRDI QIDQ1929504

Ravi Shanker, Neelam Malhotra, Sant R. Arora

Publication date: 8 January 2013

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-011-0038-1

zbMATH Keywords

quadratic programminggoal programmingset covering problemmulti-objective

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Discrete location and assignment (90B80)

Cites Work

• Linear approach to linear fractional goal programming
• Cutting planes from conditional bounds: A new approach to set covering
• A Greedy Heuristic for the Set-Covering Problem
• Computer Solutions to Minimum-Cover Problems
• Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
• Set Covering and Involutory Bases
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Enumeration technique for solving multi-objective quadratic set-covering problem using goal programming