Handbook of Combinatorial Optimization - Image 1

Price loading...

Springer Handbook of Combinatorial Optimization

Name: Handbook of Combinatorial Optimization
Brand: Springer

Architecture & Microprocessors

Price History & Forecast

No Price Data Available

Price history will appear here once data is collected from Amazon.

Price Distribution

No price data available for histogram

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
Pack Size: 3 items
ASIN: 1461379873
Category: Books > Subjects > Computing & Internet > Computer Science > Architecture & Microprocessors
Domain: Amazon UK
Release Date: 23 November 2011
Listed Since: 06 August 2014

Barcode

No barcode data available

Springer Handbook of Combinatorial Optimization

Price History & Forecast

No Price Data Available

Price Distribution

Description

Product Specifications

Barcode

Similar Products You Might Like

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

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

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

Handbook 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)

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

Academic Press Multi-Objective Combinatorial Optimization Book

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

Handbook of Optimization Theory: Decision Analysis & Application (Mathematics Research Developments Series)

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

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

Combinatorial and Algorithmic Mathematics: From Foundation to Optimization

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

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

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

Recent Advances in Computational Optimization: Results of the Workshop on Computational Optimization WCO 2017: 795 (Studies in Computational Intelligence, 795)

Linear Programming: Foundations and Extensions: 285 (International Series in Operations Research & Management Science, 285)

Linear Programming: Foundations and Extensions: 285 (International Series in Operations Research & Management Science, 285)

Local Search in Combinatorial Optimization

Parallel Computing in Optimization: 7 (Applied Optimization)

Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing: 21 (Wiley Series in Discrete Mathematics & Optimization)

Springer Intelligent Computational Optimization in Engineering

Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications: 65 (Nonconvex Optimization and Its Applications, 65)