Skip to main content
SpringerLink
Log in

Linearization Strategies for Binary Quadratic and Higher-Order Polynomial Programs

  • Living reference work entry
  • First Online:
Encyclopedia of Optimization

  • 34 Accesses

Abstract

NA

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. Adams W, Forrester R (2005) A simple recipe for concise mixed 0-1 linearizations. Res Lett 33(1): 55–61

    Google Scholar 

  2. Adams W, Forrester R (2007) Linear forms of nonlinear expressions: New insights on old ideas. Oper Res Lett 35(4):510–518

    Article  MathSciNet  MATH  Google Scholar 

  3. Adams W, Guignard M, Hahn P, Hightower W (2007) A level-2 reformulation-linearization technique bound for the quadratic assignment problem. Eur J Oper Res 180(3):983–996

    Article  MathSciNet  MATH  Google Scholar 

  4. Caprara A, Pisinger D, Toth P (1999) Exact solution of the quadratic knapsack problem. INFORMS J Comput 11(2):125–216

    Article  MathSciNet  MATH  Google Scholar 

  5. Chang C, Chang C (2000) A linearization method for mixed 0–1 polynomial programs. Comput Oper Res 27(10):1005–1016

    Article  MathSciNet  MATH  Google Scholar 

  6. Sherali H, Adams W (1990) A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J Discrete Math 3(3):411–430. https://doi.org/10.1137/0403036

    Article  MathSciNet  MATH  Google Scholar 

  7. Sherali H, Adams W (1994) A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems. Discrete Appl Math 52(1):83–106

    Article  MathSciNet  MATH  Google Scholar 

  8. Forrester R, Greenberg H (2008) Quadratic binary programming models in computational biology. Algorithmic Oper Res 3:110–129

    MathSciNet  MATH  Google Scholar 

  9. Forrester RJ, Hunt-Issak N (2020) Computational comparison of exact solution methods for 0–1 quadratic programs: recommendations for practitioners. J Appl Math 2020:21. Article ID 5974820. https://doi.org/10.1155/2020/5974820

  10. Forrester R, Waddell L (2022) Strengthening a linear reformulation of the 0–1 cubic knapsack problem via variable reordering. J Comb Optim 44:498–517

    Article  MathSciNet  MATH  Google Scholar 

  11. Furini F, Traversi E (2019) Theoretical and computational study of several linearisation techniques for binary quadratic programs. Ann Oper Res 279(1):387–411

    Article  MathSciNet  MATH  Google Scholar 

  12. Ghezavati VR, Saidi-Mehrabad M (2011) An efficient linearization technique for mixed 0–1 polynomial problem. J Comput Appl Math 235(6):1730–1738

    Article  MathSciNet  MATH  Google Scholar 

  13. Glover F (1975) Improved linear integer programming formulations of nonlinear integer programs. Manag Sci 22(4):455–460

    Article  MATH  Google Scholar 

  14. Glover F, Woolsey E Converting the 0–1 polynomial programming problem to a 0–1 linear program. Oper Res 22(1):180–182

    Google Scholar 

  15. Guignard M (2020) Strong rlt1 bounds from decomposable Lagrangean relaxation for some quadratic 0–1 optimization problems with linear constraints. Ann Oper Res 286:173–200

    Article  MathSciNet  MATH  Google Scholar 

  16. Hahn P, Zhu Y, Guignard M, Hightower W, Saltzman M (2011) A level-3 reformulation-linearization technique-based bound for the quadratic assignment problem. INFORMS J Comput 24(2):202–209

    Article  MathSciNet  MATH  Google Scholar 

  17. Duand G Kochenberger Y, Glover F, Wang H, Lewis M, Xie W, Tsuyuguchi T (2022) Theoretical and computational study of several linearisation techniques for binary quadratic programs. Int J Inf Technol Decis Mak 21(1):59–81

    Google Scholar 

  18. Li H (1994) Global optimization for mixed 0–1 programs with convex or separable continuous functions. J Oper Res Soc 45(9):1068–1076

    Article  MATH  Google Scholar 

  19. Lima R, Grossmann I (2017) On the solution of nonconvex cardinality boolean quadratic programming problems: a computational study. Comput Optim Appl 66(1):1–37

    Article  MathSciNet  MATH  Google Scholar 

  20. Mallach S (2021) Inductive linearization for binary quadratic programs with linear constraints. 4OR 19(4):549–570

    Google Scholar 

  21. Oral M, Kettani O (1992) A linearization procedure for quadratic and cubic mixed-integer problems. Oper Res 40:S109–S116

    Article  MathSciNet  MATH  Google Scholar 

  22. Sherali H, Smith JC (2007) An improved linearization strategy for zero-one quadratic programming problems. Optim Lett 1(1):33–47

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dickinson College, Carlisle, PA, USA

    Richard J. Forrester

  2. Bucknell University, Lewisburg, PA, USA

    Lucas A. Waddell

Authors
  1. Richard J. Forrester
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lucas A. Waddell
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Richard J. Forrester .

Editor information

Editors and Affiliations

  1. Department of Industrial & Systems Engin, University of Florida, Gainesville, FL, USA

    Panos M. Pardalos

  2. Departmentl of Industrial Engineering, University of Pittsburgh, Pittsburgh, PA, USA

    Oleg A. Prokopyev

Rights and permissions

Reprints and permissions

Copyright information

© 2023 Springer Nature Switzerland AG

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Forrester, R.J., Waddell, L.A. (2023). Linearization Strategies for Binary Quadratic and Higher-Order Polynomial Programs. In: Pardalos, P.M., Prokopyev, O.A. (eds) Encyclopedia of Optimization. Springer, Cham. https://doi.org/10.1007/978-3-030-54621-2_833-1

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-54621-2_833-1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-54621-2

  • Online ISBN: 978-3-030-54621-2

  • eBook Packages: Springer Reference MathematicsReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Search

Navigation