A Linearization technique for solving the quadratic set covering problem

DOI10.1080/02331939708844269zbMath0867.90082OpenAlexW2034831675MaRDI QIDQ4331991

Ratnesh Rajan Saxena, Sant R. Arora

Publication date: 4 August 1997

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

linearization techniquequadratic set coveringoptimal cover solution

Mathematics Subject Classification ID

Integer programming (90C10) Quadratic programming (90C20)

Related Items

A Branch-and-Bound Algorithm for Team Formation on Social Networks, On a linearization technique for solving the quadratic set covering problem and variations, Relation between set partitioning and set covering problems with quadratic fractional objective functions, Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows, Linearization approach to multi-objective quadratic set covering problem, Solving fuzzy linear fractional set covering problem by a goal programming based solution approach, Linearization approach to multi objective set covering problem with imprecise nonlinear fractional objectives

Cites Work

• Unnamed Item
• 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
• Computer Solutions to Minimum-Cover Problems
• Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems