Some Simplified NP-Complete Problems
M. R. GareyDavid S. JohnsonLarry J. StockmeyerPublished in: STOC (1974)
Keyphrases
- np complete problems
- np complete
- graph coloring
- phase transition
- max cut
- hard problems
- sat problem
- decision problems
- job shop scheduling
- np hard
- scheduling problem
- constraint satisfaction problems
- randomly generated
- satisfiability problem
- hyper heuristics
- max sat
- neural network
- evolutionary computation
- genetic programming
- genetic algorithm