Skip to main content
SpringerLink
Log in

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

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Busygin, S., Butenko, S., Pardalos, P.M.: A heuristic for the maximum independent set problem. J. Comb. Optim. 6, 287–297 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  • Butenko, S., Trukhanov, S.: Using critical set for the maximum independent set problem. Working paper, Texas A&M University (2006)

  • 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)

    Article  MATH  Google Scholar 

  • 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)

    Article  MATH  Google Scholar 

  • Glover, F.: Surrogate constraint duality in mathematical programming. Oper. Res. 23(3), 434–451 (1975)

    Article  MATH  MathSciNet  Google Scholar 

  • Glover, F.: Tutorial on surrogate constraint approaches for optimization in graphs. J. Heuristics 9, 175–227 (2003)

    Article  MATH  Google Scholar 

  • 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 

  • Greenberg, H.J., Pierskalla, W.P.: Surrogate mathematical programs. Oper. Res. 18, 924–939 (1970)

    Article  MATH  MathSciNet  Google Scholar 

  • Greenberg, H.J., Pierskalla, W.P.: Quasi-conjugate functions and surrogate duality. Cah. Cent. Etudes Rech. Oper. 15, 437–448 (1973)

    MATH  MathSciNet  Google Scholar 

  • Kochenberger, G.A., McCarl, B.A., Wyman, F.P.: A heuristic for general integer programming. Decis. Sci. 5(1), 36 (1974)

    Article  Google Scholar 

  • 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)

    MathSciNet  Google Scholar 

  • Osorio, M., Glover, F., Hammer, P.: Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions. Ann. Oper. Res. 117, 71–93 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  • Pardalos, P., Rodgers, G.: Computational aspects of a branch and bound algorithm for quadratic zero-one programming. Computing 45, 131–144 (1990)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Business, University of Mississippi, Oxford, USA

    Bahram Alidaee

  2. School of Business, University of Colorado at Denver, Denver, USA

    Gary Kochenberger

  3. College of Business Administration, Texas A&M International University, Laredo, USA

    Haibo Wang

Authors
  1. Bahram Alidaee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gary Kochenberger
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Haibo Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gary Kochenberger.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Alidaee, B., Kochenberger, G. & Wang, H. Simple and fast surrogate constraint heuristics for the maximum independent set problem. J Heuristics 14, 571–585 (2008). https://doi.org/10.1007/s10732-007-9054-y

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-007-9054-y

Keywords

Search

Navigation