Abstract
Non-polynomial hard (NP-hard) problems are challenging due to time-constraint. The bacteria foraging optimisation (BFO) algorithm is a metaheuristics algorithm that is used for NP-hard problems. BF...
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
