Discrete Problems in Nature Inspired Algorithms Hardback
This book includes introduction of several algorithms which are exclusively for graph based problems, namely combinatorial optimization problems, path formation problems, etc.
Each chapter includes the introduction of the basic traditional nature inspired algorithm and discussion of the modified version for discrete algorithms including problems pertaining to discussed algorithms.
- Format: Hardback
- Pages: 310 pages, 26 Tables, black and white; 127 Illustrations, black and white
- Publisher: Taylor & Francis Ltd
- Publication Date: 26/12/2017
- Category: Combinatorics & graph theory
- ISBN: 9781138196063