On a linearization technique for solving quadratic set covering problem and variations
Discrete Mathematics
2016-08-30 v2
Abstract
In this paper we identify some inaccuracies in the paper by R.R. Saxena and S.R. Arora, A Linearization technique for solving the Quadratic Set Covering Problem, Optimization, 39 (1997) 33-42. In particular, we observe that their algorithm need not guarantee optimality, contrary to what is claimed. Experimental analysis with the algorithm has been carried out to evaluate its merit as a heuristic and compared with CPLEX. The results disclose that for some class of problems the algorithm is reasonably effective while for some other class, it's performance is very poor. we also discussion similar inaccuracies in another related paper.
Cite
@article{arxiv.1509.06305,
title = {On a linearization technique for solving quadratic set covering problem and variations},
author = {Pooja Pandey and Abraham P. Punnen},
journal= {arXiv preprint arXiv:1509.06305},
year = {2016}
}