Journal of Heuristics

, Volume 14, Issue 6, pp 571–585 | Cite as

Simple and fast surrogate constraint heuristics for the maximum independent set problem

  • Bahram Alidaee
  • Gary KochenbergerEmail author
  • Haibo Wang


In a recent paper Glover (J. Heuristics 9:175–227, 2003) discussed a variety of surrogate constraint-based heuristics for solving optimization problems in graphs. The key ideas put forth in the paper were illustrated by giving specializations designed for certain covering and coloring problems. In particular, a family of methods designed for the maximum cardinality independent set problem was presented. In this paper we report on the efficiency and effectiveness of these methods based on considerable computational testing carried out on test problems from the literature as well as some new test problems.


Maximum independent set Surrogate constraints Heuristics 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Busygin, S., Butenko, S., Pardalos, P.M.: A heuristic for the maximum independent set problem. J. Comb. Optim. 6, 287–297 (2002) zbMATHCrossRefMathSciNetGoogle Scholar
  2. Butenko, S., Trukhanov, S.: Using critical set for the maximum independent set problem. Working paper, Texas A&M University (2006) Google Scholar
  3. Feo, T., Resende, A., Mauricio, G.C., Smith, S.H.: A greedy randomized adaptive search procedure for maximum independent set. Oper. Res. 42(5), 860–878 (1994) zbMATHCrossRefGoogle Scholar
  4. Fréville, A., Plateau, G.: An exact search for the solution of the surrogate dual of the 0–1 bidimensional knapsack problem. Eur. J. Oper. Res. 68, 413–421 (1993) zbMATHCrossRefGoogle Scholar
  5. Glover, F.: Surrogate constraint duality in mathematical programming. Oper. Res. 23(3), 434–451 (1975) zbMATHCrossRefMathSciNetGoogle Scholar
  6. Glover, F.: Tutorial on surrogate constraint approaches for optimization in graphs. J. Heuristics 9, 175–227 (2003) zbMATHCrossRefGoogle Scholar
  7. Glover, F., Kochenberger, G.: Critical event tabu search for multidimensional knapsack problems. In: Osman, J.H., Kelly, J.P. (eds.) Meta-Heuristics: Theory & Applications, pp. 407–427. Kluwer Academic, Dordrecht (1996) Google Scholar
  8. Greenberg, H.J., Pierskalla, W.P.: Surrogate mathematical programs. Oper. Res. 18, 924–939 (1970) zbMATHCrossRefMathSciNetGoogle Scholar
  9. Greenberg, H.J., Pierskalla, W.P.: Quasi-conjugate functions and surrogate duality. Cah. Cent. Etudes Rech. Oper. 15, 437–448 (1973) zbMATHMathSciNetGoogle Scholar
  10. Kochenberger, G.A., McCarl, B.A., Wyman, F.P.: A heuristic for general integer programming. Decis. Sci. 5(1), 36 (1974) CrossRefGoogle Scholar
  11. Lokketangen, A., Glover, F.: Surrogate constraint analysis—new heuristics and learning schemes for satisfiability problems. DIMACS Ser. Discrete Math. Theor. Comput. Sci. 35, 537–572 (1997) MathSciNetGoogle Scholar
  12. Osorio, M., Glover, F., Hammer, P.: Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions. Ann. Oper. Res. 117, 71–93 (2002) zbMATHCrossRefMathSciNetGoogle Scholar
  13. Pardalos, P., Rodgers, G.: Computational aspects of a branch and bound algorithm for quadratic zero-one programming. Computing 45, 131–144 (1990) zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  1. 1.School of BusinessUniversity of MississippiOxfordUSA
  2. 2.School of BusinessUniversity of Colorado at DenverDenverUSA
  3. 3.College of Business AdministrationTexas A&M International UniversityLaredoUSA

Personalised recommendations