Login / Signup
An O(n^lg k . 2^n/2) Time and O(k . 2^n/k) Space Algorithm for Certain NP-Complete Problems.
Jozef Vyskoc
Published in:
Theor. Comput. Sci. (1987)
Keyphrases
</>
computational complexity
cost function
dynamic programming
learning algorithm
optimal solution
optimization algorithm
evolutionary algorithm
linear programming
particle swarm optimization
benchmark problems
randomly generated
space complexity
np hard
evolutionary computation
combinatorial optimization