0 1 Knapsack Problem Solution by Rashid a N M (3 results)
- Softcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
£ 39.71
£ 11.98 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New. In.
- Softcover
Seller: preigu, Osnabrück, Germanypreigu
Contact seller5-star sellerCondition: New
£ 37.97
£ 59.53 shippingShips from Germany to U.S.A.Quantity: 5 available
Taschenbuch. Condition: Neu. The 0-1 Knapsack Problem | A solution by Genetic Algorithm | A.N.M. Bazlur Rashid | Taschenbuch | Englisch | VDM Verlag Dr. Müller | EAN 9783639295047 | Verantwortliche Person für die EU: VDM Verlag Dr. Müller, Brivibas Gatve 197, 1039 RIGA, LETTLAND, customerservice[at]vdm-vsg[dot]de | Anbieter: pre…igu.
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 43.75
£ 51.68 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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 in…teresting 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.
