On the Hardness of Approximating Some Optimization Problems That Are Supposedly Easier Than MAX CLIQUE.
Oleg VerbitskyPublished in: Comb. Probab. Comput. (1995)
Keyphrases
- optimization problems
- evolutionary algorithm
- metaheuristic
- cost function
- objective function
- optimization methods
- optimization criteria
- computational complexity
- np complete
- combinatorial optimization
- worst case
- np hard
- nonlinear programming
- phase transition
- information theoretic
- multi objective
- case study
- maximum weight
- quasi cliques
- data mining
- artificial intelligence
- information retrieval
- machine learning