Handbook of Combinatorial Optimization: Supplement Volume A - Image 1

£105.83

Springer Handbook of Combinatorial Optimization: Supplement Volume A

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

Operational Research

Price History & Forecast

Last 85 days • 85 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 85 days • 5 price levels

Days at Price

Current Price

Price Analysis

Most common price: £109 (42 days, 49.4%)

Price range: £106 - £114

Price levels: 5 different prices over 85 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

Price History & Forecast

Price Distribution

Price Analysis

Description

Product Specifications

Barcode

Similar Products You Might Like

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

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

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)

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

Complexity and Approximation: In Memory of Ker-I Ko: 12000 (Lecture Notes in Computer Science, 12000)

Lessons in Enumerative Combinatorics: 290 (Graduate Texts in Mathematics, 290)

Lessons in Enumerative Combinatorics: 290 (Graduate Texts in Mathematics, 290)

Introduction to Mathematical Programming

Modelling and Performance Analysis of Cyclic Systems: 241 (Studies in Systems, Decision and Control, 241)

New Perspectives in Algebraic Combinatorics: 38 (Mathematical Sciences Research Institute Publications, Series Number 38)

Computer Science and Operations Research: New Developments in their Interfaces

Surveys in Combinatorics 2009: 365 (London Mathematical Society Lecture Note Series, Series Number 365)

High Performance Optimization: 33 (Applied Optimization, 33)

Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems: 42 (Nonconvex Optimization and Its Applications, 42)

Linear and Nonlinear Optimization: 253 (International Series in Operations Research & Management Science, 253)

ADVANCES IN ECONOMICS AND OPTIMIZATION: Collected Scientific Papers Dedicated to the Memory of L V Kantorovich (Economic Issues, Problems and Perspectives)

Invitation to Linear Programming and Game Theory

Discrete Energy on Rectifiable Sets (Springer Monographs in Mathematics)

Foundations of Network Optimization and Games: 3 (Complex Networks and Dynamic Systems, 3)

Algorithmic Combinatorics: Enumerative Combinatorics, Special Functions and Computer Algebra: In Honour of Peter Paule on his 60th Birthday (Texts & Monographs in Symbolic Computation)

Combinatorial Scientific Computing

Algorithms as a Basis of Modern Applied Mathematics: 404 (Studies in Fuzziness and Soft Computing, 404)

An Economic Interpretation of Linear Programming

Introduction to Global Optimization: 48 (Nonconvex Optimization and Its Applications, 48)