2. Classical Complexity Theory........................................................................................ 2
|
7715
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
2771
|
Introduction to Automata Theory, Language, and Computation
– Hopcroft, Ullman
- 1979
|
|
2004
|
The Design and Analysis of Computer Algorithms
– Aho, Hopcroft, et al.
- 1974
|
|
1588
|
Computational Complexity
– Papadimitriou
- 1994
|
|
731
|
Integer and Combinatorial Optimization
– Nemhauser, Wolsey
- 1988
|
|
624
|
On computable numbers, with an application to the Entscheidungsproblem
– Turing
- 1936
|
|
341
|
The complexity of theorem proving procedures
– Cook
- 1971
|
|
312
|
Simulated annealing and Boltzmann machines
– Aarts, Korst
- 1989
|
|
205
|
A comparison of polynomial time reducibilities
– Ladner, Lynch, et al.
- 1975
|
|
175
|
Optimization and approximation in deterministic sequencing and scheduling-A survey
– Graham, Lawler, et al.
- 1979
|
|
158
|
The NP-completeness column: an ongoing guide
– Johnson
- 1984
|
|
142
|
1936], An unsolvable problem of elementary number theory
– Church
|
|
140
|
Fast approximation algorithms for the knapsack and sum of subset problems
– Ibarra, Kim
- 1975
|
|
108
|
The intrinsic computational difficulty of functions
– Cobham
- 1965
|
|
82
|
A Variant of a Recursively Unsolvable Problem
– Post
- 1946
|
|
64
|
1978]. `Strong' NP-completeness re-sults: Motivation, examples, and implications
– Garey, Johnson
- 1981
|
|
60
|
Exact and approximate algorithms for scheduling non-identical processors
– Horowitz, Sahni
- 1976
|
|
59
|
Trees and flowers
– Edmonds
- 1965
|
|
56
|
Reducibility among combinatorial problems," Complexity of Computer Computations
– Karp
- 1972
|
|
56
|
1976]. Algorithms for scheduling independent tasks
– Sahni
- 2000
|
|
26
|
Heuristics for scheduling resource-constrained projects: an experimental investigation
– Cooper
- 1976
|
|
26
|
Theory of Integer and Linear Programming
– Schrijver
- 1986
|
|
14
|
Independence results in computer science
– Hartmanis, Hopcroft
- 1976
|
|
13
|
New insights on the complexity of resource-constrained project scheduling - A case of single-mode scheduling", Manuskripte aus den Instituten fr Betriebswirtschaftslehre der Universitt Kiel 390
– SCHIRMER
- 1996
|
|
9
|
Towards the standardization of performance measures for project scheduling heuristics
– BADIRU
- 1988
|
|
9
|
Simulated annealing for the QAP - Optimal tradeoff between simulation time and solution quality
– Laursen
- 1993
|
|
8
|
Heuristic Procedures for Resource-Constrained Project Scheduling with Minimal and Maximal Time Lags: The Minimum Project-Duration and Resource-Levelling Problems", Report WIOR-443
– BRINKMANN, NEUMANN
- 1994
|
|
8
|
A terminological proposal
– KNUTH
- 1974
|
|
6
|
Simulated Annealing for resource-constrained scheduling
– JEFFCOAT, BULFIN
- 1993
|
|
6
|
Fast approximation schemes for knapsack problems
– LAWLER
- 1977
|
|
6
|
A comparison of heuristics for scheduling projects with cash flows and resource restrictions", Management Science 32
– RUSSELL
- 1986
|
|
5
|
Remarks on 'Some Extensions of the Discrete Lotsizing and Scheduling Problem' by
– BRGGEMANN, JAHNKE
- 1994
|
|
5
|
Scheduling with constrained processor allocation for interval orders
– JANSEN
- 1993
|
|
4
|
Ausgewählte Probleme der Produktionsplanung - Modellierung, Komplexität und neuere Lösungsmöglichkeiten
– BRÜGGEMANN
- 1995
|
|
4
|
A greedy heuristic for the mean tardiness sequencing problem
– FADLALLA, EVANS, et al.
- 1994
|
|
4
|
On the complexity of generalized due date scheduling problems
– HALL, SETHI, et al.
- 1991
|
|
4
|
Constraint satisfaction problems in project scheduling
– SCHMIDT
- 1989
|
|
3
|
Aufzhlbarkeit, Berechenbarkeit, Entscheidbarkeit, third edition
– HERMES
- 1978
|
|
3
|
Postscript about NP-hard problems
– KNUTH
- 1974
|
