Relation between set partitioning and set covering problems with quadratic fractional objective functions

DOI10.1007/s12597-011-0052-3zbMath1261.90062OpenAlexW2069775175MaRDI QIDQ1929500

Ravi Shanker, Ratnesh Rajan Saxena, 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-0052-3

zbMATH Keywords

quadratic programmingset-partitioningset-covering

Mathematics Subject Classification ID

Integer programming (90C10) Fractional programming (90C32)

Cites Work

• On a new class of nonlinear set covering problems arising in wireless network design
• A set partitioning problem with linear fractional objective function
• Relation between set covering and set partitioning problems
• Non-linear set covering problem
• A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem
• Enumeration Technique for the Set Covering Problem with a Linear Fractional Functional as its Objective Function
• A Linearization technique for solving the quadratic set covering problem
• Computer Solutions to Minimum-Cover Problems
• Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
• Set Covering and Involutory Bases

This page was built for publication: Relation between set partitioning and set covering problems with quadratic fractional objective functions