Bookcover of The 0-1 Knapsack Problem
Booktitle:

The 0-1 Knapsack Problem

A solution by Genetic Algorithm

VDM Verlag Dr. Müller (2010-10-01 )

Books loader

Omni badge eligible for voucher
ISBN-13:

978-3-639-29504-7

ISBN-10:
3639295048
EAN:
9783639295047
Book language:
English
Blurb/Shorttext:
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.
Publishing house:
VDM Verlag Dr. Müller
Website:
http://www.vdm-verlag.de
By (author) :
A.N.M. Bazlur Rashid
Number of pages:
92
Published on:
2010-10-01
Stock:
Available
Category:
Informatics, IT
Price:
49.00 €
Keywords:
0-1 Knapsack Problem, Solution, genetic algorithm, Optimization, Complexity, Optimal

Books loader

Newsletter

Adyen::amex Adyen::mc Adyen::visa Adyen::cup Adyen::unionpay Paypal Wire Transfer

  0 products in the shopping cart
Edit cart
Loading frontend
LOADING