Skip to main content
Springer Nature Link
Log in

NP-complete Problems and Proof Methodology

  • Reference work entry
Encyclopedia of Optimization

  • 739 Accesses

Article Outline

Keywords

Some Known NP-Complete Problems

Methodology for NP-Completeness Proofs

Example Proofs

Conclusion

See also

References

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Cheng TCE, Sin CCS (1990) A state-of-the-art review of parallel-machine scheduling research. Europ J Oper Res 47:271–292

    MATH  Google Scholar 

  2. Cook SA (1971) The complexity of theorem proving procedures. In: Proc. 3rd Annual ACM Symposium on Theory of Computing. ACM, New York, pp 151–158

    Google Scholar 

  3. Gabow HN, Maheshwari SN, Osterweil L (1976) On two problems in the generation of program test paths. IEEE Trans. Software Engin., London, pp 227–231

    Google Scholar 

  4. Garey MR, Johnson DS (1979) Computers and intractability. Freeman, New York

    MATH  Google Scholar 

  5. Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of Computer Computations. Plenum, New York, pp 85–103

    Google Scholar 

  6. Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (1993) Sequencing and scheduling: Algorithms and complexity. In: Graves SC, Rinnooy Kan AHG, Zipkin P (eds) Handbook Oper. Res. and Management Sci.: Logistics of Production and Inventory. North-Holland, Amsterdam, pp 445–522

    Google Scholar 

  7. Lenstra JK, Rinnooy Kan AHG, Brucker P (1977) Complexity of machine scheduling problems. Ann Discret Math 1:343–362

    MathSciNet  Google Scholar 

  8. Martello S, Toth P (1990) Knapsack problems: Algorithms and computer implementations. Wiley, New York

    MATH  Google Scholar 

  9. Papadimitriou CH, Steiglitz K (1982) Combinatorial optimization: Algorithms and complexity. Prentice-Hall, Englewood Cliffs

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department OR and Operations Management, Case Western Reserve University, Cleveland, USA

    Sanatan Rai & George Vairaktarakis

Authors
  1. Sanatan Rai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. George Vairaktarakis
    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

Rai, S., Vairaktarakis, G. (2008). NP-complete Problems and Proof Methodology . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_462

Download citation

Publish with us

Policies and ethics