1997649

9783540402862

Knapsack Problems
Knapsack Problems
$213.18
$3.95 Shipping
  • Condition: New
  • Provider: LightningBooks Contact
  • Provider Rating:
    85%
  • Ships From: Multiple Locations
  • Shipping: Standard, Expedited (tracking available)
  • Comments: Fast shipping! All orders include delivery confirmation.

   30-day money back guarantee
$135.32
$3.95 Shipping
List Price
$209.00
Discount
35% Off
You Save
$73.68

  • Condition: Good
  • Provider: Better World Books Contact
  • Provider Rating:
    92%
  • Ships From: Mishawaka, IN
  • Shipping: Standard, Expedited
  • Comments: Former Library book. Shows some signs of wear, and may have some markings on the inside. 100% Money Back Guarantee. Shipped to over one million happy customers. Your purchase benefits world literacy!

   30-day money back guarantee

Ask the provider about this item.

Most renters respond to questions in 48 hours or less.
The response will be emailed to you.
Cancel
  • ISBN-13: 9783540402862
  • ISBN: 3540402861
  • Publication Date:
  • Publisher: Springer

AUTHOR

SUMMARY

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.Kellerer, Hans is the author of 'Knapsack Problems', published 2004 under ISBN 9783540402862 and ISBN 3540402861.

[read more]

Questions about purchases?

You can find lots of answers to common customer questions in our FAQs

View a detailed breakdown of our shipping prices

Learn about our return policy

Still need help? Feel free to contact us

View college textbooks by subject
and top textbooks for college

The ValoreBooks Guarantee

The ValoreBooks Guarantee

With our dedicated customer support team, 30-day no-questions-asked return policy, and our price match guarantee, you can rest easy knowing that we're doing everything we can to save you time, money, and stress.