The 0-1 Knapsack Problem
The 0-1 Knapsack Problem
Regular price
Checking stock...
Regular price
Checking stock...
Proud to be B-Corp
Our business meets the highest standards of verified social and environmental performance, public transparency and legal accountability to balance profit and purpose. In short, we care about people and the planet.
The feel-good place to buy books
- Free delivery in Ireland
- Supporting authors with AuthorSHARE
- 100% recyclable packaging
- Proud to be a B Corp – A Business for good
- Buy-back with Ziffit
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 | Unavailable |
| ISBN 13 | 9783639295047 |
| ISBN 10 | 3639295048 |
| Title | The 0-1 Knapsack Problem |
| Author | A N M Bazlur Rashid |
| Condition | Unavailable |
| Binding Type | Paperback |
| Publisher | VDM Verlag |
| Year published | 2010-10-01 |
| Number of pages | 92 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |