Handbook of Combinatorial Optimization: Supplement Volume A - Image 1

£109.18

Springer Handbook of Combinatorial Optimization: Supplement Volume A

Name: Handbook of Combinatorial Optimization: Supplement Volume A
Brand: Springer
Price: 109.18 GBP
Availability: InStock

Operational Research

This is the most expensive it has ever been. Walk away.

£109 today · previous high £109 · all-time low £106

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 • 2 price levels

Days at Price

Current Price

Price Analysis

Most common price: £109 (21 days, 61.8%)

Price range: £106 - £109

Price levels: 2 different prices over 34 days

Description

Combinatorial (or discrete) optimization is one of the most active fields in the interface of operations research, computer science, and applied math ematics. Combinatorial optimization problems arise in various applications, including communications network design, VLSI design, machine vision, air line crew scheduling, corporate planning, computer-aided design and man ufacturing, database query design, cellular telephone frequency assignment, constraint directed reasoning, and computational biology. Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. All these problems, when formulated mathematically as the minimization or maximization of a certain function defined on some domain, have a commonality of discreteness. Historically, combinatorial optimization starts with linear programming. Linear programming has an entire range of important applications including production planning and distribution, personnel assignment, finance, alloca tion of economic resources, circuit simulation, and control systems. Leonid Kantorovich and Tjalling Koopmans received the Nobel Prize (1975) for their work on the optimal allocation of resources. Two important discover ies, the ellipsoid method (1979) and interior point approaches (1984) both provide polynomial time algorithms for linear programming. These algo rithms have had a profound effect in combinatorial optimization. Many polynomial-time solvable combinatorial optimization problems are special cases of linear programming (e.g. matching and maximum flow). In addi tion, linear programming relaxations are often the basis for many approxi mation algorithms for solving NP-hard problems (e.g. dualheuristics).

Product Specifications

Brand: Springer
Format: paperback
ASIN: 1441948139
Category: Books > Subjects > Business, Finance & Law > Management > Operational Research
Domain: Amazon UK
Release Date: 03 December 2010
Listed Since: 06 July 2010

Barcode

No barcode data available

Springer Handbook of Combinatorial Optimization: Supplement Volume A

This is the most expensive it has ever been. Walk away.

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

Handbook of Combinatorial Optimization

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

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

Logic-Based 0–1 Constraint Programming: 5 (Operations Research/Computer Science Interfaces Series, 5)

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

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

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

Springer Mathematical Theory of Optimization: 56 - Book

Combinatorial Programming: Methods and Applications: Proceedings of the NATO Advanced Study Institute held at the Palais des Congrès, Versailles, ... 1974: 19 (Nato Science Series C:, 19)

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

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

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

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

Combinatorial and Algorithmic Mathematics: From Foundation to Optimization

A First Course in Combinatorial Optimization: 36 (Cambridge Texts in Applied Mathematics, Series Number 36)

Exact and Heuristic Methods in Combinatorial Optimization: A Study on the Linear Ordering and the Maximum Diversity Problem: 175 (Applied Mathematical Sciences, 175)

Wiley Applications of Combinatorial Optimization - Mathematics

Logic-Based 0–1 Constraint Programming: 5 (Operations Research/Computer Science Interfaces Series, 5)

Nonlinear Combinatorial Optimization: 147 (Springer Optimization and Its Applications, 147)

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

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

Interior Point Methods of Mathematical Programming: 5 (Applied Optimization, 5)

Geometry of Cuts and Metrics: 15 (Algorithms and Combinatorics, 15)

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