二次集覆盖问题及其变分的线性化方法
On a linearization technique for solving quadratic set covering problem and variations
摘要:
本文指出了R.R. Saxena和S.R.陈文龙,一种求解二次集覆盖问题的线性化技术,最优化,39(1997)33-42。特别是,我们观察到,他们的算法不需要保证最优性,相反,声称。与该算法进行了实验分析,以评估其优点作为一种启发式和CPLEX相比。结果表明,该算法对某些问题是合理有效的,而对另一些类,它的性能是很差的。我们在另一篇相关论文中也讨论了类似的不准确性。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。