Abstract
The minimum weight vertex cover problem (MWVCP) is one of the classic combinatorial optimisation problems. In this paper, we have proposed a modified jumping particle swarm optimisation approach, n...
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
