A tolerance-based heuristic approach for the weighted independent set problem
- 224 Downloads
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.
KeywordsCombinatorial optimization Independent set problem Heuristics Notion of a tolerance
All authors are partially supported by LATNA Laboratory, NRU HSE, RF government grant, ag. 11.G34.31.0057. This study comprises research findings of the first two authors from the “Calculus of tolerances for combinatorial optimization problems: theory and algorithms” project carried out within the Higher School of Economics’ 2011–2012 Academic Fund Program. This research was supported by the Federal Target Program “Research and educational specialists of innovative Russia for 2009–2012”, state contract No 14.B37.21.0393.
- Boyko V, Goldengorin B, Kuzmenko V (2006) Tolerance-based algorithms. Theory Optim Decis 5:98–104 (in Ukrainian)Google Scholar
- Cormen T, Leiserson C, Rivest R, Stein C (2001) Introduction of algorithms, 2nd edn. MIT Press/McGraw-Hill, CambridgeGoogle Scholar
- Ernst C, Dong C, Jager G, Richter D, Molitor P (2010) Finding good tours for huge euclidean TSP instances by iterative backbone contraction. In: AAIM, pp 119–130Google Scholar
- Ghosh D, Goldengorin B, Gutin G, Jager G (2007) Tolerance-based greedy algorithms for the traveling salesman problem. In: Bapat R, Das A, Partasaraty T, Neogy S (eds) Mathematical programming and game theory for decision making. World Scientific Publishing, SingaporeGoogle Scholar
- Greenberg H (1998) An annotated bibliography for post-solution analysis in mixed integer and combinatorial optimization. In: Woodruff D (ed) Advances in computational and stochastic optimization, logic programming and heuristic search. Kluwer Academic Publishers, New York, pp 97–148Google Scholar
- Jager G, Molitor P (2008) Algorithms and experimental study for the traveling salesman problem of second order. In: COCOA, pp 211–224Google Scholar
- Reinfeld N, Vogel W (1965) Mathematical programming. Prentice Hall, Englewood CliffsGoogle Scholar