• Title: Knapsack Problems: Algorithms and Computer Implementations
• Author(s) Silvano Martello, Paolo Toth
• Publisher: John Wiley & Sons; 1 edition (November 1990)
• Hardcover/Paperback: 308 pages
• eBook: PDF
• Language: English
• ISBN-10/ASIN: 0471924202
• ISBN-13: 978-0471924203
• Share This:  

Book Description

This book provides a comprehensive overview of the methods for solving Knapsack Problems (KP), its variants and generalizations. By presenting a range of algorithmic techniques, this book is also a suitable tool for studying modern algorithms.

Here is a state of art examination on exact and approximate algorithms for a number of important NP-hard problems in the field of integer linear programming, which the authors refer to as 'knapsack'. Includes not only the classical knapsack problems such as binary, bounded, unbounded or binary multiple, but also less familiar problems such as subset-sum and change-making.

Well known problems that are not usually classified in the knapsack area, including generalized assignment and bin packing, are also covered. The text fully develops an algorithmic approach without losing mathematical rigor.

The book starts with a basic introduction to the knapsack problem. It proceeds with a discussion about the basic techniques available for the solution to this problem, which makes it useful reading for undergraduate students of computer science, mathematics and economics. In conclusion, it could be said that the book is a valuable source for students, but also for researchers interested in this problem.

• N/A

• Amazon
• Amazon (2004 Edition)

• Operations Research and Optimization
• Algorithms and Data Structures
• Combinatorics and Game Theory
• Discrete and Finite Mathematics
• Computational Complexity
• Introduction to Computer Science

• Knapsack Problems: Algorithms and Computer Implementations (Silvano Martello, et al)
• The Mirror Site (1) - PDF
• The Mirror Site (2) - PDF
• The Mirror Site (3) - PDF

• Planning Algorithms (Steven M. LaValle)

  This is the only book for teaching and referencing of Planning Algorithms in applications including robotics, computational biology, computer graphics, manufacturing, aerospace applications and medicine, etc.

• Convex Optimization (Stephen Boyd, et al.)

  On recognizing convex optimization problems and then finding the most appropriate technique for solving them. It contains many worked examples in fields such as engineering, computer science, mathematics, statistics, finance, and economics.

• Global Optimization Algorithms - Theory and Application

  This book is devoted to global optimization algorithms, which are methods to find optimal solutions for given problems. It especially focuses on Evolutionary Computation by discussing evolutionary algorithms, genetic algorithms, Genetic Programming, etc.

• Ant Colony Optimization - Techniques and Applications

  The book first describes the translation of observed ant behavior into working optimization algorithms. The Ant Colony Optimization is then introduced and viewed in the general context of combinatorial optimization.

• Algorithms for Decision Making (Mykel Kochenderfer, et al)

  This textbook provides a broad introduction to algorithms for decision making under uncertainty, covering the underlying mathematical problem formulations and the algorithms for solving them.

• Traveling Salesman Problem, Theory and Applications

  This book is a collection of current research in the application of evolutionary algorithms and other optimal algorithms to solving the Travelling Salesman Problem (TSP). Most importantly, it presents both theoretical as well as practical applications of TSP,

• Tabu Search (Wassim Jaziri)

  The goal of this book is to report original researches on algorithms and applications of Tabu Search to real-world problems as well as recent improvements and extensions on its concepts and algorithms.