A tolerance-based heuristic approach for the weighted independent set problem

B. I. Goldengorin, D. S. Malyshev (), P. M. Pardalos and V. A. Zamaraev
Additional contact information
B. I. Goldengorin: National Research University Higher School of Economics
D. S. Malyshev: National Research University Higher School of Economics
P. M. Pardalos: National Research University Higher School of Economics
V. A. Zamaraev: National Research University Higher School of Economics

Journal of Combinatorial Optimization, 2015, vol. 29, issue 2, No 7, 433-450

Abstract: Abstract The notion of a tolerance is a helpful tool for designing approximation and exact algorithms for solving combinatorial optimization problems. In this paper we suggest a tolerance-based polynomial heuristic algorithm for the weighted independent set problem. Several computational experiments show that our heuristics works very well on graphs of a small density.

Keywords: Combinatorial optimization; Independent set problem; Heuristics; Notion of a tolerance (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-013-9606-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:29:y:2015:i:2:d:10.1007_s10878-013-9606-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-013-9606-z

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().