Knapsack Problems. Kellerer, H.; Pferschy, U.; and Pisinger, D. 2004.
abstract   bibtex   
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. The book is equally suited for beginners and experts: All classical techniques like branch-and-bound, dynamic programming and approximation are introduced in a thorough way with minimal prerequisites in the first three chapters. Then the ideas are extended up to the most recent results of this area many of them originating from the authors themselves. The chapters dealing with particular versions and extensions of the knapsack problem are self-contained to a high degree which provides a valuable source of reference for researchers. The bibliography covers almost 400 references in this field with cross-references to the text. Numerous pseudocode-descriptions of algorithms are provided. The performance of the most successful algorithms is illustrated by extensive computational studies, many of them published for the first time in this book.
@Book{kellerer04knapsack,
  title     = {Knapsack Problems},
  publisher = Springer,
  year      = {2004},
  author    = {Hans Kellerer and Ulrich Pferschy and David Pisinger},
  abstract  = {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. The book is equally suited for beginners and experts: All classical techniques like branch-and-bound, dynamic programming and approximation are introduced in a thorough way with minimal prerequisites in the first three chapters. Then the ideas are extended up to the most recent results of this area many of them originating from the authors themselves. The chapters dealing with particular versions and extensions of the knapsack problem are self-contained to a high degree which provides a valuable source of reference for researchers. The bibliography covers almost 400 references in this field with cross-references to the text. Numerous pseudocode-descriptions of algorithms are provided. The performance of the most successful algorithms is illustrated by extensive computational studies, many of them published for the first time in this book.},
  keywords  = {knapsack},
  owner     = {Sebastian},
  timestamp = {2006.04.11},
}
Downloads: 0