Skip to main content
SpringerLink
Log in

Variable objective search

  • Published:
Journal of Heuristics Aims and scope Submit manuscript

Abstract

This paper introduces the variable objective search framework for combinatorial optimization. The method utilizes different objective functions used in alternative mathematical programming formulations of the same combinatorial optimization problem in an attempt to improve the solutions obtained using each of these formulations individually. The proposed technique is illustrated using alternative quadratic unconstrained binary formulations of the classical maximum independent set problem in graphs.

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.

Similar content being viewed by others

References

  • Aarts, E., Lenstra, J.K. (eds.): Local Search in Combinatorial Optimization. Wiley, Chichester (2003)

    MATH  Google Scholar 

  • Abello, J., Butenko, S., Pardalos, P., Resende, M.: Finding independent sets in a graph using continuous multivariable polynomial formulations. J. Glob. Optim. 21, 111–137 (2001)

    Article  MathSciNet  MATH  Google Scholar 

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

    Chapter  Google Scholar 

  • DIMACS Cliques, Coloring, and satisfiability: second DIMACS implementation challenge. http://dimacs.rutgers.edu/Challenges/ (1995). Accessed April 2010

  • Glover, F., Kochenberger, G. (eds.): Handbook Of Metaheuristics. Springer, London (2002)

    Google Scholar 

  • Hansen, P., Mladenović, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130, 449–467 (2001)

    Article  MATH  Google Scholar 

  • Horst, R., Pardalos, P.M., Thoai, N.V.: Introduction to Global Optimization, 2 edn. Kluwer Academic, Dordrecht (2000)

    MATH  Google Scholar 

  • Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097–1100 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  • Motzkin, T.S., Straus, E.G.: Maxima for graphs and a new proof of a theorem of Turán. Can. J. Math. 17, 533–540 (1965)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Industrial and Systems Engineering, Texas A&M University, College Station, TX, 77843-3131, USA

    Sergiy Butenko & Oleksandra Yezerska

  2. Industrial Engineering & Management, Oklahoma State University, Stillwater, OK, 74078, USA

    Balabhaskar Balasundaram

Authors
  1. Sergiy Butenko
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Oleksandra Yezerska
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Balabhaskar Balasundaram
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sergiy Butenko.

Additional information

This research was partially supported by the US Department of Energy Grant DE-SC0002051 and US Air Force Office of Scientific Research Award No. FA9550-09-1-0154.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Butenko, S., Yezerska, O. & Balasundaram, B. Variable objective search. J Heuristics 19, 697–709 (2013). https://doi.org/10.1007/s10732-011-9174-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10732-011-9174-2

Keywords

Search

Navigation