|
| << previous | next >> |
Journal description
All volumes of the corresponding journal
All issues of the corresponding volume
All articles of the corresponding issues
Details for article 5 of 12 found articles
| Title: |
An Overview of Complexity Theory in Discrete Optimization: Part II. Results and Implications |
| Author: |
Parker, R. Gary Rardin, Ronald L. |
| Appeared in: |
IIE transactions |
| Paging: | Volume 14 (1982) nr. 2 pages 83-89 |
| Year: |
1982-06-01 |
| Contents: |
Over the past decade, complexity theory has emerged from a branch of computer science almost unknown in the operations research community into a topic of widespread interest and research. Part I of this tutorial overview of the subject (TRANSACTIONS, March 1982) developed important background concepts of the theory. This paper uses that background to define and investigate the implications of NP-Hardness, NP-Completeness, NP-Equivalency, the NP≠NP conjecture, and various approximations. |
| Publisher: |
Taylor & Francis |
| Source file: |
Elektronische Wetenschappelijke Tijdschriften |
Details for article 5 of 12 found articles
| << previous | next >> |