An Overview of Complexity Theory in Discrete Optimizations: Part I. Concepts

Abstract Over the past decade, complexity theory has emerged from a branch of computer science almost unknown to the operations research community into a topic of widespread interest and research. The goals of the theory are to broadly classify problems and algorithms according to their convenience for solution by digital computers. Very considerable progress has been achieved, but some of the concepts in the theory are so subtle that their implications are as often misunderstood as grasped correctly. In this and the succeeding paper, we will present an elementary tutorial review of the important concepts and results in complexity theory. Emphasis is placed on constructs and implications for persons interested in discrete optimization—especially scheduling theory. The present Part I develops background concepts and definitions. Part II (in the June 1982 TRANSACTIONS) will cover results and implications.

[1]  Richard M. Karp,et al.  Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane , 1977, Math. Oper. Res..

[2]  L. Khachiyan.  Polynomial algorithms in linear programming , 1980 .

[3]  Edward G. Coffman,et al.  Computer and job-shop scheduling theory , 1976 .

[4]  A. Kan.  Machine Scheduling Problems: Classification, Complexity and Computations , 1976 .

[5]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

[6]  Sartaj Sahni,et al.  Approximate Algorithms for the 0/1 Knapsack Problem , 1975, JACM.

[7]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[8]  Oscar H. Ibarra,et al.  Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems , 1975, JACM.

[9]  Victor Klee,et al.  Combinatorial Optimization: What is the State of the Art , 1980, Math. Oper. Res..

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  V. Klee,et al.  HOW GOOD IS THE SIMPLEX ALGORITHM , 1970 .

[12]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[13]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[14]  Richard M. Karp,et al.  A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem , 1979, SIAM J. Comput..

[15]  Ronald L. Rardin,et al.  An Overview of Complexity Theory in Discrete Optimization: Part II. Results and Implications , 1982 .