Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Optimization pp 3153–3159Cite as

Quadratic Integer Programming: Complexity and Equivalent Forms

  • Reference work entry

Article Outline

Keywords and Phrases

Introduction

Complexity of Quadratic Programming

Equivalence Between Discrete and Continuous Problems

Integer Programming Problems and Complementarity Problems

Integer Programming Problems and Quadratic Integer Programming Problems

Various Equivalent Forms of Quadratic Zero-One Programming Problems

Complexity of Quadratic Zero-One Programming Problems

   k-clique Problem

Quadratic Zero-One Programming and Mixed Integer Programming

  Quadratic Zero-One Programming and Mixed Integer Programming

  A New Linearization Approach

References

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   2,499.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Chaovalitwongse WA, Pardalos PM, Prokoyev OA (2004) Reduction of multi-quadratic 0–1 programming problems to linear mixed 0–1 programming problems. Oper Res Lett 32(6):517–522

    Article  MATH  MathSciNet  Google Scholar 

  2. Giannessi F, Niccolucci F (1976) Connections between nonlinear and integer programming problems. Istituto Nazionale di Alta Matematica, Symposia Mathematica 19:161–176

    Google Scholar 

  3. Hager WW, Pardalos PM, Roussos IM, Sahinoglou HD (1991) Active constraints, indefinite quadratic programming, and test problems. J Optim Theor Appl 68(3):499–511

    Article  MATH  MathSciNet  Google Scholar 

  4. Horst R, Pardalos PM, Thoai NV (1995) Introduction to global optimization. Kluwer, Dordrecht

    MATH  Google Scholar 

  5. Pardalos PM (1991) Global optimization algorithms for linearly constrained indefinite quadratic problems. Comput Math Appl 21:87–97

    Article  MATH  MathSciNet  Google Scholar 

  6. Pardalos PM, Rodgers G (1989) Parallel branch and bound algorithms for unconstrained quadratic zero-one programming. In: Sharda R et al (eds) Impact of recent computer advances on operations research. Elsevier, pp 131–143

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  8. Pardalos PM, Schnitger G (1988) Checking local optimality in constrained quadratic programming is \( \mathcal{NP} \)-hard. Oper Res Lett 7(1):33–35

    Article  MATH  MathSciNet  Google Scholar 

  9. Pardalos PM, Vavasis S (1991) Quadratic programming with one negative eigenvalue is \( \mathcal{NP} \)-hard. J Global Optim 1:15–23

    Article  MATH  MathSciNet  Google Scholar 

  10. Sahni S (1974) Computationally related problems. SIAM J Comput 3:262–279

    Article  MathSciNet  Google Scholar 

  11. Vavasis S (1991) Nonlinear optimization: complexity issues. Oxford Univeristy Press, Oxford

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial and Systems Engineering, Rutgers University, Piscataway, USA

    W. Art Chaovalitwongse

  2. Department of Biomedical Engineering, Rutgers University, Piscataway, USA

    Ioannis P. Androulakis

  3. Department of Industrial and Systems Engineering, University of Florida, Gainesville, USA

    Panos M. Pardalos

Authors
  1. W. Art Chaovalitwongse
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ioannis P. Androulakis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Panos M. Pardalos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Chaovalitwongse, W.A., Androulakis, I.P., Pardalos, P.M. (2008). Quadratic Integer Programming: Complexity and Equivalent Forms . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_536

Download citation

Publish with us

Policies and ethics

Search

Navigation