Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Austrian Post 5.99 € GLS courier 5.49 € DPD courier 4.99 € DPD point 3.99 €

Contact

How to shop

Help

My account

▸ Empty :-(

Knapsack Problems

Name: Knapsack Problems
Brand: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
SKU: 01562699
Price: 254.09 EUR
Availability: InStock
Author: H. Kellerer
ISBN: 9783540402862

H. Kellerer

U. Pferschy

D. Pisinger

Language

English

Book Hardback

Libristo code: 01562699

Publishers Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, December 2003

This book provides a full-scale presentation of all methods and techniques available for the solutio... Full description

Libristo code: 01562699

622 b

254.09 € VAT included

In stock at our supplier Shipping in 10-13 days

Delivery to Austria

Up to 30 days for returns

Customers also purchased

Città invisibili Italo Calvino

Paperback

13.69 €

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-containedto 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.