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.
References
Aiello W, Chung F, Lu L (2000) A random graph model for power-law graphs. Exp Math 10:53–66
Balas E, Saltzman M (1991) An algorithm for the three-index assignment problem. Oper Res 39:150–161
Barabasi A, Reka A (1999) Emergence of scaling in random networks. Science 286:509–512
Bekker H, Braad E, Goldengorin B (2005) Selecting the roots of a small system of polynomial equations by tolerance based matching. Lect Notes Comput Sci 3503:610–613
Bron C, Kerbosch J (1973) Finding all cliques of an undirected graph. Commun ACM 16:575–577
Bollobas B, Riordan R, Spencer J, Tusnady G (2001) The degree sequence of a scale-free random graph process. Random Struct Algorithms 18:279–290
Boyko V, Goldengorin B, Kuzmenko V (2006) Tolerance-based algorithms. Theory Optim Decis 5:98–104 (in Ukrainian)
Chen C, Kuo M, Sheu J (1988) An optimal time algorithm for finding a maximum weight independent set in a tree. BIT Numer Math 28:353–356
Cormen T, Leiserson C, Rivest R, Stein C (2001) Introduction of algorithms, 2nd edn. MIT Press/McGraw-Hill, Cambridge
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–130
Faloutsos M, Faloutsos P, Faloutsos C (1999) On the power-law relationships of the internet topology. Comput Commun Rev 29:251–262
Gal T, Greenberg H (1997) Advances in sensitivity analysis and parametric programming. Kluwer Academic Publishers, New York
Germs R, Goldengorin B, Turkensteen M (2012) Lower tolerance-based branch and bound algorithms for the ATSP. Comput Oper Res 39:291–298
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, Singapore
Goldengorin B, Jager G, Molitor P (2006) Tolerances applied in combinatorial optimization. J Comput Sci 2:716–734
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–148
Helsgaun K (2000) An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur J Oper Res 126:106–130
Helsgaun K (2009) General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic. Math Program Comput 1:119–163
Jager G, Molitor P (2008) Algorithms and experimental study for the traveling salesman problem of second order. In: COCOA, pp 211–224
Kruskal J (1956) On the shortest spanning subtree of a graph and the traveling salesman problem. Proc Am Math Soc 7(1):48–50
Kumar R, Raghavan P, Rajagopalan S, Tomkins A (1999) Trawing the Web for emerging cyber-communities. Comput Netw 7:1481–1493
Murty K (1968) An algorithm for ranking all the assignments in order of increasing cost. Oper Res 16: 682–687
Ramaswamy R, Orlin J, Chakravarti N (2005) Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs. Math Program 102:355–369
Reinfeld N, Vogel W (1965) Mathematical programming. Prentice Hall, Englewood Cliffs
Shier D, Witzgall C (1980) Arc tolerances in minimum-path and network flow problems. Networks 10: 277–291
Sotskov Y, Leontev V, Gordeev E (1995) Some concepts of stability analysis in combinatorial optimization. Discret Appl Math 58:169–190
Tarjan R (1982) Sensitivity analysis of minimum spanning trees and shortest path trees. Inf Process Lett 14:30–33
Turkensteen M, Ghosh D, Goldengorin B, Sierksma G (2008) Tolerance-based branch and bound algorithms for the ATSP. Eur J Oper Res 189:775–788
Van der Poort E, Libura M, Sierksma G, Van der Veen J (1999) Solving the \(k\)-best traveling salesman problem. Comput Oper Res 26:409–425
Volgenant A (2006) An addendum on sensitivity analysis of the optimal assignment. Eur J Oper Res 169:338–339
Acknowledgments
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.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Goldengorin, B.I., Malyshev, D.S., Pardalos, P.M. et al. A tolerance-based heuristic approach for the weighted independent set problem. J Comb Optim 29, 433–450 (2015). https://doi.org/10.1007/s10878-013-9606-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-013-9606-z