Handbook on Modelling for Discrete Optimization (Hardcover, 2006 ed.)

The primary objective underlying the Handbook on Modelling for Discrete Optimization is to demonstrate and detail the pervasive nature of Discrete Optimisation. While its applications cut across an wide range of activities, many of the applications are only known to specialists. The aim of this handbook is to correct this. It has long been recognized that modelling is a critically important mathematical activity in designing algorithms for solving these discrete optimization problems. Nevertheless solving the resultant models is also often far from straightforward. In recent years, it has become possible to solve many large-scale discrete optimization problems. However, some problems remain a challenge, even though advances in mathematical methods, hardware, and software technology have pushed the frontiers forward. This handbook couples the difficult, critical-thinking aspects of mathematical modeling with the hot area of discrete optimization. It will be done in an academic handbook treatment outlining the state-of-the-art for researchers across the domains of the Computer Science, Math Programming, Applied Mathematics, Engineering, and Operations Research. Computer Science, and Combinatorics.

General

Imprint:	Springer-Verlag New York
Country of origin:	United States
Series:	International Series in Operations Research & Management Science, 88
Release date:	May 2006
First published:	2006
Editors:	Gautam M. Appa • Leonidas Pitsoulis • H. paul Williams
Dimensions:	235 x 155 x 25mm (L x W x T)
Format:	Hardcover
Pages:	434
Edition:	2006 ed.
ISBN-13:	978-0-387-32941-3
Categories:	Books > Science & Mathematics > Mathematics > Optimization > General
LSN:	0-387-32941-2
Barcode:	9780387329413

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!