Verwandte Artikel zu Knapsack Problems: Algorithms and Computer Implementations...
Knapsack Problems: Algorithms and Computer Implementations (Wiley-Interscience Series in Discrete Mathematics and Optimization) - Softcover
Inhaltsangabe
The development of computational complexity theory has led, in the last 15 years, to insights into the inherent difficulty of combinatorial optimization problems, but has also produced an undesirable side effect which can be summarized by the "equation" NP-hardness = intractability, thereby diminishing attention to the study of exact algorithms for NP-hard problems. This book presents exact and approximate algorithms for a number of important NP-hard problems in the field of integer linear programming, which are grouped under the term "knapsack". The reader will find not not only the "classical" knapsack problems (binary, bounded, unbounded, binary multiple), but also less familiar problems (subset-sum, change-making) or well-known problems which are not usually classified in the knapsack area (generalized assignment, bin-packing). The goal of the book is to fully develop an algorithmic approach without losing mathematical rigour. For each problem, the authors start by giving a mathematical model, discussing its relaxations and deriving procedures for the computation of bounds. They then develop approximate algorithms, approximation schemes dynamic programming techniques and branch-and-bound algorithms.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Reseña del editor
The development of computational complexity theory has led, in the last 15 years, to insights into the inherent difficulty of combinatorial optimization problems, but has also produced an undesirable side effect which can be summarized by the "equation" NP-hardness = intractability, thereby diminishing attention to the study of exact algorithms for NP-hard problems. This book presents exact and approximate algorithms for a number of important NP-hard problems in the field of integer linear programming, which are grouped under the term "knapsack". The reader will find not not only the "classical" knapsack problems (binary, bounded, unbounded, binary multiple), but also less familiar problems (subset-sum, change-making) or well-known problems which are not usually classified in the knapsack area (generalized assignment, bin-packing). The goal of the book is to fully develop an algorithmic approach without losing mathematical rigour. For each problem, the authors start by giving a mathematical model, discussing its relaxations and deriving procedures for the computation of bounds. They then develop approximate algorithms, approximation schemes dynamic programming techniques and branch-and-bound algorithms.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
EUR 53,74
EUR 7,47 für den Versand von Vereinigtes Königreich nach Deutschland
Versandziele, Kosten & DauerSuchergebnisse für Knapsack Problems: Algorithms and Computer Implementations...
Beispielbild für diese ISBN
Knapsack Problems: Algorithms and Computer Implementations
Anbieter: Anybook.com, Lincoln, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,700grams, ISBN:0471924202. Bestandsnummer des Verkäufers 5568939
Anzahl: 1 verfügbar