Re:Genetic Algorithm for Knapsack Problem
by raverbashing on Wednesday June 19, 2013 @09:46AM
(#5905469)
Every NP problem can be converted in another NP problem, so you could probably try to convert your subset problem to a TSP problem (but it wouldn't be useful in practice)
[ Parent
| on HN ]
Re:Genetic Algorithm for Knapsack Problem
by a-nikolaev on Wednesday June 19, 2013 @11:19AM
(#5906020)
Nitpicking: In general, an NP problem can be reduced to an NP-hard problem (in poly-time).