£169.06

Springer Knapsack Problems

Name: Knapsack Problems
Brand: Springer
Price: 169.06 GBP
Availability: InStock

Linear Programming

This is the usual price. Wait for it to drop, or tell us your number.

£169 today · usual range £145–£180 · best ever £145

NEW HERE?

Amazon shows you one price. We show you all of them.

Tosheroon watches Amazon prices so you don't have to. Every product on Amazon has a price history — we make it visible. Set the price you'd actually pay, and we'll email you the second it gets there. No app, no account, one email.

WHAT'S ON THIS PAGE

↓ Price chart
when this has been cheap or pricey

↓ Forecast
where the price is heading next

↓ Statistics
all-time high & low, recent range

↑ Price alert
name your number, we'll email you

Price History & Forecast

Grey patches = out of stock. Cheaper = lower on the chart. Hover for exact prices.

Last 34 days · 34 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 34 days • 5 price levels

Days at Price

Current Price

Price Analysis

Most common price: £170 (14 days, 41.2%)

Price range: £145 - £180

Price levels: 5 different prices over 34 days

Description

Thirteen years have passed since the seminal book on knapsack problems by Martello and Toth appeared. On this occasion a former colleague exclaimed back in 1990: "How can you write 250 pages on the knapsack problem?" Indeed, the definition of the knapsack problem is easily understood even by a non-expert who will not suspect the presence of challenging research topics in this area at the first glance. However, in the last decade a large number of research publications contributed new results for the knapsack problem in all areas of interest such as exact algorithms, heuristics and approximation schemes. Moreover, the extension of the knapsack problem to higher dimensions both in the number of constraints and in the num ber of knapsacks, as well as the modification of the problem structure concerning the available item set and the objective function, leads to a number of interesting variations of practical relevance which were the subject of intensive research during the last few years. Hence, two years ago the idea arose to produce a new monograph covering not only the most recent developments of the standard knapsack problem, but also giving a comprehensive treatment of the whole knapsack family including the siblings such as the subset sum problem and the bounded and unbounded knapsack problem, and also more distant relatives such as multidimensional, multiple, multiple-choice and quadratic knapsack problems in dedicated chapters.

Product Specifications

Brand: Springer
Format: paperback
ASIN: 3642073115
Category: Books > Subjects > Science, Nature & Maths > Mathematics > Optimisation > Linear Programming
Domain: Amazon UK
Release Date: 07 December 2010
Listed Since: 14 June 2010

Barcode

No barcode data available

Springer Knapsack Problems

This is the usual price. Wait for it to drop, or tell us your number.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Cutting and Packing Problems: From the Perspective of Combinatorial Optimization

Dynamic Programming Multi-Objective Combinatorial Optimization: 331 (Studies in Systems, Decision and Control, 331)

Dynamic Programming Multi-Objective Combinatorial Optimization: 331 (Studies in Systems, Decision and Control, 331)

Integer Programming, 2nd Edition

Techniques for Designing and Analyzing Algorithms (Chapman & Hall/CRC Cryptography and Network Security Series)

Integer Programming and Combinatorial Optimization: 11th International IPCO Conference, Berlin, Germany, June 8-10, 2005, Proceedings: 3509 (Lecture Notes in Computer Science, 3509)

Ant Colony Optimization and Applications: 947 (Studies in Computational Intelligence, 947)

Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization (Fields Institute Monographs)

Combinatorial Optimization: Theory and Algorithms: 21 (Algorithms and Combinatorics, 21)

Combinatorial Optimization: Theory and Algorithms: 21 (Algorithms and Combinatorics, 21)

Algorithms in C, Parts 1-5 (Bundle): Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (3rd Edition)

Amazon Basics Grey 30L Backpack - Padded Laptop Daypack

Local Search in Combinatorial Optimization

Totto - Backpack for 14 Inch Laptop, Model Adelaide 1, 3 Compartments, 2 Bottle Pockets, Secret Pocket, Strap for Hanging Suitcase, Durable, Peach 2.0, pink, M, Casual

Invicta Backpack, JOLLY X Eco-friendly Knapsack, For Office, Day Trips & Commuting, For School, Sport, Free Time, with Side Pockets & 15,6'' Laptop Sleeve, Italian Design, orange

Java Library of Graph Algorithms and Optimization Book

Aerolite 40x30x15 Under Seat Cabin Luggage - 2 Pack Black

Lumesner 17.3 Inch Laptop Backpack with USB Charging Port

Lumesner 17.3 Inch Laptop Backpack with USB Charging Port

Akro-Mils 13017 Stak-N-Store Heavy Duty Stackable Open Front Plastic Storage Container Bin, (15-Inch x 20-Inch x 12-1/2-Inch), Clear, (3-Pack)

A Java Library of Graph Algorithms and Optimization (Discrete Mathematics and Its Applications)

Advances In Combinatorial Optimization: Linear Programming Formulations Of The Traveling Salesman And Other Hard Combinatorial Optimization Problems

LOVEVOOK 17.3 Inch Laptop Backpack - USB Charging Port

Invicta Backpack, JOLLY BEAR PATCH Knapsack, Casual Daypack, For Office, Day Trips & Commuting, For School, Sport, Free Time, 14'' Laptop Sleeve, Italian Design, blue