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

In this paper we identify various inaccuracies in the paper by Saxena and Arora (Optimization 39:33–42, 1997 ). In particular, we observe that their algorithm does not guarantee optimality, contrary to what is claimed. Experimental analysis has been carried out to assess the value of this algorithm...

Full description

Saved in:
Bibliographic Details
Published inOptimization letters Vol. 11; no. 7; pp. 1357 - 1370
Main Authors Pandey, Pooja, Punnen, Abraham P.
Format Journal Article
LanguageEnglish
Published Berlin/Heidelberg Springer Berlin Heidelberg 01.10.2017
Subjects
Computational Intelligence
Mathematics
Mathematics and Statistics
Numerical and Computational Physics
Operations Research/Decision Theory
Optimization
Original Paper
Simulation
Agorithms
Set covering problem
Quadratic programming
0-1 programming
Heuristic
Online AccessGet full text
ISSN1862-4472
1862-4480
DOI10.1007/s11590-016-1081-x

Cover

More Information
Summary:In this paper we identify various inaccuracies in the paper by Saxena and Arora (Optimization 39:33–42, 1997 ). In particular, we observe that their algorithm does not guarantee optimality, contrary to what is claimed. Experimental analysis has been carried out to assess the value of this algorithm as a heuristic. The results disclose that for some classes of problems the Saxena–Arora algorithm is effective in achieving good quality solutions while for some other classes of problems, its performance is poor. We also discuss similar inaccuracies in another related paper.
ISSN:1862-4472
1862-4480
DOI:10.1007/s11590-016-1081-x