Kontakt
Kako nakupovati
Dostava
Svetovalec pri nakupu
Network and Assignment Models
Angleščina
172 b
30 dni za vračilo blaga
This book presented solutions to some combinatorial programming problems using Lexi search approach and Heuristic Approach. In each model we find shortest path based on the given constraints. This book classified into five chapters and an exact algorithm is proposed for each problem. The algorithm solves the problem on identifying the key patterns which optimize the objective of the cost and requirement of respective nodes. The algorithm calculates the solution incrementally for different patterns and the best combination is taken as the solution. We tested the algorithms using C language. The proposed algorithms shows encouraging results and compared with existing algorithms. This book is very useful to young researchers and students.
O knjigi
Angleščina
Kategorije
Podarite to knjigo še danes
To je povsem preprosto
1 Dodajte knjigo v košarico in izberite dostavo kot darilo 2 V zameno vam bomo poslali kupon 3 Knjiga bo dostavljena na naslov obdarovancaPozdravljeni! Sem Libroamiko, vaš knjižni svetovalec.
Kako vam lahko pomagam?