On a linearization technique for solving the quadratic set covering problem and variations

DOI10.1007/s11590-016-1081-xzbMath1381.90073arXiv1509.06305OpenAlexW2962876538MaRDI QIDQ1676486

Abraham P. Punnen, Pooja Pandey

Publication date: 9 November 2017

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.06305

zbMATH Keywords

quadratic programming0-1 programmingheuristicset covering problemagorithms

Mathematics Subject Classification ID

Quadratic programming (90C20) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (2)

A Branch-and-Bound Algorithm for Team Formation on Social Networks ⋮ Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems

Cites Work

• Computational experience with approximation algorithms for the set covering problem
• A linear time algorithm for the Koopmans-Beckmann QAP linearization and related problems
• A characterization of linearizable instances of the quadratic minimum spanning tree problem
• Approximation of the quadratic set covering problem
• Compact linearization for binary quadratic problems
• An O(n⁴) Algorithm for the QAP Linearization Problem
• A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem
• A Linearization technique for solving the quadratic set covering problem
• Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
• Unnamed Item
• Unnamed Item

This page was built for publication: On a linearization technique for solving the quadratic set covering problem and variations