Processing ......
Free Computer, Mathematics, Technical Books and Lecture Notes, etc.
Knapsack Problems: Algorithms and Computer Implementations
Want to know the Homepage of a particular airport? Click here to find out.
  • 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 Online, PDF files
  • Language: English
  • ISBN-10/ASIN: 0471924202
  • ISBN-13: 978-0471924203
  • Share This:  

Book Description

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.

About the Authors
  • N/A
Reviews and Rating: Related Book Categories: Read and Download Links:
Book Categories
Other Categories
Resources and Links