You might also like

More about 0-1 Knapsack Problem

• Book details
• Synopsis
• Trending among others

You get 118 loyalty points

Book synopsis

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.

Book details

Book category Books in English Computing & information technology Information technology: general issues

• Full title: 0-1 Knapsack Problem
• Author: A.N.M. Bazlur Rashid
• Language: English
• Binding: Paperback
• Number of pages: 92
• EAN: 9783639295047
• ISBN: 3639295048
• ID: 06836569
• Publisher: VDM Verlag
• Weight: 145 g
• Dimensions: 229 × 152 × 6 mm
• Date of publishing: 01. October 2010

Trending among others

---

---

---