Skip to main content
SpringerLink
Log in

On a Polynomial Fractional Formulation for Independence Number of a Graph

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

In this paper we characterize the local maxima of a continuous global optimization formulation for finding the independence number of a graph. Classical Karush-Kuhn-Tucker conditions and simple combinatorial arguments are found sufficient to deduce several interesting properties of the local and global maxima. These properties can be utilized in developing new approaches to the maximum independent set problem.

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

  • J. Abello S. Butenko P. Pardalos M. Resende (2001) ArticleTitleFinding independent sets in a graph using continuous multivariable polynomial formulations Journal of Global Optimization 21 111–137 Occurrence Handle10.1023/A:1011968411281

    Article  Google Scholar 

  • B. Balasundaram S. Butenko (2005) ArticleTitleConstructing test functions for global optimization using continuous formulations of graph problems Optimization Methods and Software 20 439–452 Occurrence Handle10.1080/10556780500139641

    Article  Google Scholar 

  • I.M. Bomze (1997) ArticleTitleEvolution towards the maximum clique Journal of Global Optimization 10 143–164 Occurrence Handle10.1023/A:1008230200610

    Article  Google Scholar 

  • I.M. Bomze M. Budinich P.M. Pardalos M. Pelillo (1999) The maximum clique problem D.-Z. Du P.M. Pardalos (Eds) Handbook of Combinatorial Optimization Kluwer Academic Publishers Dordrecht, The Netherlands 1–74

    Google Scholar 

  • S. Burer R.D.C. Monteiro Y. Zhang (2001) ArticleTitleRank-two relaxation heuristics for MAX-CUT and other binary quadratic programs SIAM Journal on Optimization 12 503–521 Occurrence Handle10.1137/S1052623400382467

    Article  Google Scholar 

  • S. Burer R.D.C. Monteiro Y. Zhang (2002) ArticleTitleMaximum stable set formulations and heuristics based on continuous optimization Mathematical Programming 94 137–166 Occurrence Handle10.1007/s10107-002-0356-4

    Article  Google Scholar 

  • S. Busygin S. Butenko P.M. Pardalos (2002) ArticleTitleA heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere Journal of Combinatorial Optimization 6 287–297 Occurrence Handle10.1023/A:1014899909753

    Article  Google Scholar 

  • Y. Caro Z. Tuza (1991) ArticleTitleImproved lower bounds on k-independence Journal of Graph Theory 15 99–107

    Google Scholar 

  • P.L. Angelis Particlede I.M. Bomze G. Toraldo (2004) ArticleTitleEllipsoidal approach to box-constrained quadratic problems Journal of Global Optimization 28 1–15 Occurrence Handle10.1023/B:JOGO.0000006654.34226.fe

    Article  Google Scholar 

  • DIMACS (1995), Cliques, coloring, and satisfiability: second DIMACS implementation challenge, http://dimacs.rutgers.edu/Challenges/. Accessed August 2004.

  • M.R. Garey D.S. Johnson (1979) Computers and Intractability: A Guide to the Theory of NP-completeness W.H. Freeman and Company New York

    Google Scholar 

  • Gibbons, L.E., Hearn, D.W. and Pardalos, P.M. (1996), A continuous based heuristic for the maximum clique problem, In: Johnson, D.S. and Trick, M.A. (eds.), Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Vol. 26 of DIMACS Series, American Mathematical Society, Providence, RI, pp. 103–124.

  • L.E. Gibbons D.W. Hearn P.M. Pardalos M.V. Ramana (1997) ArticleTitleContinuous characterizations of the maximum clique problem Mathematics of Operations Research 22 754–768 Occurrence Handle10.1287/moor.22.3.754

    Article  Google Scholar 

  • M.X. Goemans D.P. Williamson (1995) ArticleTitleImproved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming Journal of ACM 42 1115–1145 Occurrence Handle10.1145/227683.227684

    Article  Google Scholar 

  • J. Harant (1998) ArticleTitleA lower bound on the independence number of a graph Discrete Mathematics 188 239–243 Occurrence Handle10.1016/S0012-365X(98)00048-X

    Article  Google Scholar 

  • J. Harant (2000) ArticleTitleSome news about the independence number of a graph Discussiones Mathematicae Graph Theory 20 71–79

    Google Scholar 

  • J. Harant A. Pruchnewski M. Voigt (1999) ArticleTitleOn dominating sets and independent sets of graphs Combinatorics, Probability and Computing 8 547–553 Occurrence Handle10.1017/S0963548399004034

    Article  Google Scholar 

  • MathWorks (2004), The mathworks Matlab ® optimization toolbox – fmincon, http://www.mathworks.com/access/helpdesk/help/toolbox/optim/fmincon.html. Accessed August 2004.

  • T.S. Motzkin E.G. Straus (1965) ArticleTitleMaxima for graphs and a new proof of a theorem of Turán Canadian Journal of Mathematics 17 533–540

    Google Scholar 

  • P. Pardalos (1996) Continuous approaches to discrete optimization problems G.D. Pillo F. Giannessi (Eds) Nonlinear Optimization and Applications Plenum Publishing Corporation New York 313–328

    Google Scholar 

  • H. Tuy P.T. Thach H. Konno (2004) ArticleTitleOptimization of polynomial fractional functions Journal of Global Optimization 29 19–44 Occurrence Handle10.1023/B:JOGO.0000035016.74398.e6

    Article  Google Scholar 

  • Wei, V.K. (1981), A lower bound on the stability number of a simple graph, Technical Report TM 81-11217-9, Bell Laboratories, Murray Hill, NJ.

Download references

Author information

Authors and Affiliations

  1. Department of Industrial and Systems Engineering, Texas A&M University, 236 Zachry Eng. Centre, 3131 TAMU, College Station, TX, 77843, USA

    Balabhaskar Balasundaram

  2. Department of Industrial and Systems Engineering, Texas A&M University, College Station, TX, 77843, USA

    Sergiy Butenko

Authors
  1. Balabhaskar Balasundaram
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sergiy Butenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Balabhaskar Balasundaram.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Balasundaram, B., Butenko, S. On a Polynomial Fractional Formulation for Independence Number of a Graph. J Glob Optim 35, 405–421 (2006). https://doi.org/10.1007/s10898-005-5185-6

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-005-5185-6

Keywords

Search

Navigation