0 1 Knapsack Problem Solution by Rashid a N M (4 results)

Author
Title
Refine with Advanced Search

Refine your search

  • Books (4)

  • New (4)

to

Custom price range (£)

to

  • Language: English

    Published by VDM Verlag Dr. Müller, 2010

    3639295048 / 9783639295047

    • Softcover

    Seller: California Books, Miami, FL, U.S.A.California Books

    4-star seller
    Contact seller

    Condition: New

    £ 47.13

     Free Shipping 
    Ships within U.S.A.

    Quantity: Over 20 available

    Condition: New.

  • Language: English

    Published by VDM Verlag Dr. Müller, 2010

    3639295048 / 9783639295047

    • Softcover

    Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections

    5-star seller
    Contact seller

    Condition: New

    £ 39.71

    £ 11.29 shipping 
    Ships from United Kingdom to U.S.A.

    Quantity: Over 20 available

    Condition: New. In.

  • Language: English

    Published by VDM Verlag Dr. Müller, 2010

    3639295048 / 9783639295047

    • Softcover

    Seller: preigu, Osnabrück, Germanypreigu

    5-star seller
    Contact seller

    Condition: New

    £ 38.38

    £ 60.10 shipping 
    Ships 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 | Einband - flex.(Paperback) | Englisch | 2010 | VDM Verlag Dr. Müller | EAN 9783639295047 | Verantwortliche Person für die EU: OmniScriptum GmbH & Co. KG, Bahnhofstr. 28, 66111 Saarbrücken, info[at]akademikerverlag[dot]de | Anbieter: preigu.

  • Language: English

    Published by VDM Verlag Dr. Müller, 2010

    3639295048 / 9783639295047

    • Softcover
    • Print on Demand

    Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH

    5-star seller
    Contact seller

    Condition: New

    £ 45.65

    £ 26.19 shipping 
    Ships 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 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.