|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'503'724
Articles rated: 2609
23 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
On a linearization technique for solving quadratic set covering problem and variations | | Pooja Pandey
; Abraham P. Punnen
; | | Date: |
21 Sep 2015 | | 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. | | Source: | arXiv, 1509.6305 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER