Combinatorial Optimization: Theory and Algorithms: 21 (Algorithms and Combinatorics, 21) - Image 1

£50.93

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

Name: Combinatorial Optimization: Theory and Algorithms: 21 (Algorithms and Combinatorics, 21)
Brand: Springer
Price: 50.93 GBP
Availability: InStock

Decision Making

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

£51 today · usual range £0–£0 · best ever £26

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 582 days • 582 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 582 days • 5 price levels

Days at Price

Current Price

Price Analysis

Most common price: £47 (414 days, 71.1%)

Price range: £26 - £55

Price levels: 5 different prices over 582 days

Description

This comprehensive textbook on combinatorial optimization places special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. It is based on numerous courses on combinatorial optimization and specialized topics, mostly at graduate level. This book reviews the fundamentals, covers the classical topics (paths, flows, matching, matroids, NP-completeness, approximation algorithms) in detail, and proceeds to advanced and recent topics, some of which have not appeared in a textbook before. Throughout, it contains complete but concise proofs, and also provides numerous exercises and references. This sixth edition has again been updated, revised, and significantly extended. Among other additions, there are new sections on shallow-light trees, submodular function maximization, smoothed analysis of the knapsack problem, the (ln 4+ɛ)-approximation for Steiner trees, and the VPN theorem. Thus, this book continues torepresent the state of the art of combinatorial optimization.

Product Specifications

Brand: Springer
Format: Paperback
ASIN: 3662585669
Category: Books > Subjects > Business, Finance & Law > Management > Management Skills > Decision Making
Domain: Amazon UK
Release Date: 11 January 2019
Listed Since: 10 January 2019

Barcode

No barcode data available

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

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

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

Introduction to Combinatorial Optimization: 196 (Springer Optimization and Its Applications, 196)

Paradigms of Combinatorial Optimization: Problems and New Approaches, Volume 2

Wiley Applications of Combinatorial Optimization - Mathematics

Combinatorial Optimization: 7th International Symposium, ISCO 2022, Virtual Event, May 18–20, 2022, Revised Selected Papers: 13526 (Lecture Notes in Computer Science, 13526)

Combinatorial Optimization and Applications: Third International Conference, COCOA 2009, Huangshan, China, June 10-12, 2009, Proceedings: 5573 (Lecture Notes in Computer Science, 5573)

Applications of Continuous Mathematics to Computer Science: 38 (Theory and Decision Library B, 38)

Handbook of Combinatorial Optimization

Combinatorial Optimization: 33 (Wiley Series in Discrete Mathematics and Optimization)

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

Combinatorial Optimization: Polyhedra and Efficiency: 24 (Algorithms and Combinatorics, 24)

Combinatorial Algorithms: 33rd International Workshop, IWOCA 2022, Trier, Germany, June 7–9, 2022, Proceedings: 13270 (Lecture Notes in Computer Science, 13270)

Combinatorial Algorithms: 30th International Workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019, Proceedings: 11638 (Lecture Notes in Computer Science, 11638)

Applied Combinatorics

Global Methods for Combinatorial Isoperimetric Problems: 90 (Cambridge Studies in Advanced Mathematics, Series Number 90)

Combinatorial Algorithms: 34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7–10, 2023, Proceedings: 13889 (Lecture Notes in Computer Science, 13889)

Combinatorial and Global Optimization (Series on Applied Mathematics): 14

Progress in Combinatorial Optimization: Recent Progress

Combinatorial Algorithms: Generation, Enumeration, and Search: 7 (Discrete Mathematics and Its Applications)

Springer Metaheuristics for Combinatorial Optimization 1332

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)

Combinatorial and Algorithmic Mathematics: From Foundation to Optimization

Combinatorial Algorithms: Generation, Enumeration, and Search (Discrete Mathematics and Its Applications)