By Topic

Ant Colony Optimization for NP-Hard Problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$15 $15
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

This chapter contains sections titled: Routing Problems, Assignment Problems, Scheduling Problems, Subset Problems, Application of ACO to Other NP-Hard Problems, Machine Learning Problems, Application Principles of ACO, Bibliographical Remarks, Things to Remember, Computer Exercises