Normal view
MARC view
- Non-dterministic polynomial-time hard (NP-hard)
Non-dterministic polynomial-time hard (NP-hard) (Topical Term)
Machine generated authority record
Work cat.: (UPMIN)2682: Garillos, Cinmayii Abarsolo. 1363, Firefly-simulated annealing (F-SA) algorithm for continuous constrained optimization /, 2011