Pedigree Polytopes: New Insights on Computational Complexity of Combinatorial Optimisation Problems - Image 1

£83.11

Springer Pedigree Polytopes: New Insights on Computational Complexity of Combinatorial Optimisation Problems

Name: Pedigree Polytopes: New Insights on Computational Complexity of Combinatorial Optimisation Problems
Brand: Springer
Price: 83.11 GBP
Availability: InStock

E-Commerce

It has never been this cheap. We have no record of a lower price.

£83 today · cheaper than every other day in the last 3 months

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 82 days · 82 data points (no recent data)

Historical

Generating forecast…

Price Distribution

Price distribution over 82 days • 7 price levels

Days at Price

Current Price

Price Analysis

Most common price: £93 (25 days, 30.5%)

Price range: £83 - £96

Price levels: 7 different prices over 82 days

Description

This book defines and studies a combinatorial object called the pedigree and develops the theory for optimising a linear function over the convex hull of pedigrees (the Pedigree polytope). A strongly polynomial algorithm implementing the framework given in the book for checking membership in the pedigree polytope is a major contribution. This book challenges the popularly held belief in computer science that a problem included in the NP-complete class may not have a polynomial algorithm to solve. By showing STSP has a polynomial algorithm, this book settles the P vs NP question. This book has illustrative examples, figures, and easily accessible proofs for showing this unexpected result. This book introduces novel constructions and ideas previously not used in the literature. Another interesting feature of this book is it uses basic max-flow and linear multicommodity flow algorithms and concepts in theseproofs establishing efficient membership checking for the pedigree polytope. Chapters 3-7 can be adopted to give a course on Efficient Combinatorial Optimization. This book is the culmination of the author's research that started in 1982 through a presentation on a new formulation of STSP at the XIth International Symposium on Mathematical Programming at Bonn.

Product Specifications

Brand: Springer
Format: hardcover
ASIN: 9811999511
Category: Books > Subjects > Business, Finance & Law > E-Commerce
Domain: Amazon UK
Release Date: 28 March 2023
Listed Since: 20 December 2022

Barcode

No barcode data available

Springer Pedigree Polytopes: New Insights on Computational Complexity of Combinatorial Optimisation Problems

It has never been this cheap. We have no record of a lower price.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

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)

Hybrid Metaheuristics: Powerful Tools for Optimization (Artificial Intelligence: Foundations, Theory, and Algorithms)

Extremal Optimization: Fundamentals, Algorithms, and Applications

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

Combinatorial and Algorithmic Mathematics: From Foundation to Optimization

Linear and Integer Optimization: Theory and Practice, Third Edition (Advances in Applied Mathematics)

Essentials of Tropical Combinatorics (Graduate Studies in Mathematics)

Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining: 146 (Intelligent Systems Reference Library, 146)

Parameterized Algorithms

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

Hybrid Metaheuristics: 434 (Studies in Computational Intelligence, 434)

Handbook of Combinatorial Optimization: Supplement Volume A

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

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