> Details

Kellerer, Hans [Author]; Pferschy, Ulrich [Author]; Pisinger, David [Author] ; Kellerer, Hans G. [Other]

Knapsack problems : with 33 tables

Reference
management

Bookmarks

Remove from
bookmarks

Share this on Whatsapp

Close

Bookmarks



You can manage bookmarks using lists, please log in to your user account for this.
  • Media type: Book
  • Title: Knapsack problems : with 33 tables
  • Contributor: Kellerer, Hans [Author]; Pferschy, Ulrich [Author]; Pisinger, David [Author]; Kellerer, Hans G. [Other]
  • imprint: Berlin; Heidelberg [u.a.]: Springer, 2004
  • Extent: XX, 546 S.; graph. Darst; 25 cm
  • Language: German; English
  • ISBN: 9783642073113; 3642073115; 9783540402862; 3540402861
  • RVK notation: QH 425 : Sonstige Arten der Optimierung (z.B. Optimierung mit mehrfacher Zielsetzung [multiobjective programming], fuzzy mathematical programming)
    SK 890 : Ganzzahlige und kombinatorische Optimierung, Graphentheorie
  • Keywords: Kombinatorische Optimierung > Rucksackproblem
  • Origination:
  • Footnote: Literaturverz. S. [495] - 525
    Hier auch später erschienene, unveränd. Nachdr
  • Description: 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.

copies

(0)

Bestand der TU Dresden

  • Shelf-mark: 2002 8 075388
  • Item ID: 10537400N