MENÜ MENÜ
  • Sie verwenden einen veralteten Webbrowser, weshalb es zu Problemen mit der Darstellung kommen kann. Bei Problemen mit der Bestellabgabe können Sie gerne auch telefonisch bestellen unter: 01805 / 30 99 99 (0,14 €/Min., Mobil max. 0,42 €/Min.)

The 0-1 Knapsack Problem

Rashid:The 0-1 Knapsack Problem
Autor: A.N.M. Bazlur Rashid
Verfügbarkeit: Auf Lager.
Artikelnummer: 1069513
ISBN / EAN: 9783639295047

Verfügbarkeit: sofort lieferbar

49,00 €
Inkl. MwSt. , zzgl. Versandkosten

Zusatzinformation

  • Autor:
  • Verlag: VDM Verlag Dr. Müller
  • ISBN / EAN: 9783639295047
  • Bindung: Taschenbuch

Produktbeschreibung

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.

0 Kundenmeinungen

Bitte schreiben Sie uns Ihre Meinung zu: The 0-1 Knapsack Problem

  • Wenn Sie dieses Eingabefeld sehen sollten, lassen Sie es leer!

Sie könnten auch an folgenden Produkten interessiert sein