Knapsack problems : with 33 tables

This book provides a full-scale presentation of all methods and techniques available for the solution of the knapsack problem. This most basic combinatorial optimization problem appears explicitly or as a subproblem in a wide range of optimization models with backgrounds such diverse as cutting and packing, finance, logistics or general integer programming. This monograph spans the range from a comprehensive introduction of classical algorithmic methods to the unified presentation of the most recent and advanced results in this area many of them originating from the authors. The chapters dealing with particular versions and extensions of the knapsack problem are self-contained to a high degree and provide a valuable source of reference for researchers. Due to its simple structure, the knapsack problem is an ideal model for introducing solution techniques to students of computer science, mathematics and economics. The first three chapters give an in-depth treatment of several basic techniques, making the book also suitable as underlying literature for courses in combinatorial optimization and approximation.

Standort
Deutsche Nationalbibliothek Frankfurt am Main
ISBN
9783540402862
3540402861
Maße
24 cm
Umfang
XX, 546 S.
Sprache
Englisch
Anmerkungen
graph. Darst.
Literaturverz. S. 495 - 525

Klassifikation
Mathematik
Schlagwort
Kombinatorische Optimierung
Rucksackproblem

Ereignis
Veröffentlichung
(wo)
Berlin, Heidelberg, New York, Hong Kong, London, Milan, Paris, Tokyo
(wer)
Springer
(wann)
2004
Urheber

Inhaltsverzeichnis
Rechteinformation
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
Letzte Aktualisierung
11.06.2025, 14:29 MESZ

Datenpartner

Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.

Beteiligte

Entstanden

  • 2004

Ähnliche Objekte (12)