Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

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

Free delivery for purchases over 19 990 Ft

DPD courier 1 190 Ft Post 1 795 Ft Post 1 690 Ft Post 1 690 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft DPD point 990 Ft GLS courier 1 690 Ft GLS point 1 190 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Knapsack Problems

Name: Knapsack Problems
Brand: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
SKU: 01562699
Price: 99396 HUF
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

676 b

99 396 Ft

In stock at our supplier Shipping in 10-13 days

30-day return policy

Customers also purchased

Prehistorický svět v životní velikosti Dougal Dixon

Hardback

6 354 Ft

Koty vojaky. Proroctva počynajutsja 5. Nebezpečnyj šljach Erin Hunter

Hardback

7 458 Ft

Mein Schulgeist Hanako 13 Etsuko Tabuchi

Paperback

2 866 Ft

Černý Petr Králíček Bing

Cards

705 Ft

Noc Elie Wiesel

Hardback

3 557 Ft

Noční vycházky Josef Veselý

Paperback

2 426 Ft

Poznaj swoj glos... Aneta Lastik

Paperback

1 971 Ft

Beden Dili Joe Navarro

Paperback

7 384 Ft

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.