The combinatorics of pivoting for the maximum weight clique
Operations Research Letters, ISSN: 0167-6377, Vol: 32, Issue: 6, Page: 523-529
2004
- 4Citations
- 10Captures
Metric Options: Counts1 Year3 YearSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Article Description
In this paper we prove the equivalence between a pivoting-based heuristic (PBH) for the maximum weight clique problem and a combinatorial greedy heuristic. It is also proved that PBH always returns a local solution although this is not always guaranteed for Lemke's method, on which PBH is based.
Bibliographic Details
http://www.sciencedirect.com/science/article/pii/S0167637704000392; http://dx.doi.org/10.1016/j.orl.2004.02.005; http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=3042812038&origin=inward; https://linkinghub.elsevier.com/retrieve/pii/S0167637704000392; https://api.elsevier.com/content/article/PII:S0167637704000392?httpAccept=text/xml; https://api.elsevier.com/content/article/PII:S0167637704000392?httpAccept=text/plain; https://dx.doi.org/10.1016/j.orl.2004.02.005
Elsevier BV
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know