The 0-1 Knapsack Problem by A N M Bazlur Rashid

The 0-1 Knapsack Problem by A N M Bazlur Rashid

Optimization algorithms are increasingly popular in engineering design activities like maximizing or minimizing a certain goal, primarily because of the availability and affordability of high speed computers. There is a large class of interesting problems (e.g., optimization) for which no reasonably fast algorithms have been developed. For the last three decades genetic algorithm is being used in structural optimization, function optimization, database query optimization and parametric optimization and so on. The 0-1 knapsack problem is an NP-Hard problem and due to its high computational complexity, algorithms such as backtracking, dynamic programming for exact solution of the 0-1 knapsack problem are not suitable for most real-time decision making applications, such as admission control for interactive multimedia systems or service level agreement management in telecommunication network. The book presents a genetic algorithmic approach for finding near optimal solutions of 0-1 knapsack problem, with reduced computational complexity and is suitable for real-time applications. The analysis should help in the improvement of optimization algorithms and useful in communication fields.

SKU	Non disponible
ISBN 13	9783639295047
ISBN 10	3639295048
Titre	The 0-1 Knapsack Problem
Auteur	A N M Bazlur Rashid
État	Non disponible
Type de reliure	Paperback
Éditeur	VDM Verlag
Année de publication	2010-10-01
Nombre de pages	92
Note de couverture	La photo du livre est présentée à titre d'illustration uniquement. La reliure, la couverture ou l'édition réelle peuvent varier.
Note	Non disponible