Combinatorial optimization is a multidisciplinary scientific area,
lying in the interface of three major scientific domains:
mathematics, theoretical computer science and management.
The three volumes of the Combinatorial Optimization series aims
to cover a wide range of topics in this area. These topics also
deal with fundamental notions and approaches as with several
classical applications of combinatorial optimization.
"Concepts of Combinatorial Optimization," is divided into three
parts: On the complexity of combinatorial optimization problems,
that presents basics about worst-case and randomized
complexity;Classical solution methods, that presents the two
most-known methods for solving hard combinatorial optimization
problems, that are Branch-and-Bound and Dynamic
Programming;Elements from mathematical programming, that presents
fundamentals from mathematical programming based methods that are
in the heart of Operations Research since the origins of this
field.
General
Imprint: |
Iste Ltd And John Wiley & Sons Inc
|
Country of origin: |
United Kingdom |
Release date: |
July 2010 |
First published: |
August 2010 |
Authors: |
VT Paschos
|
Dimensions: |
235 x 162 x 28mm (L x W x T) |
Format: |
Hardcover
|
Pages: |
380 |
Edition: |
Volume 1 |
ISBN-13: |
978-1-84821-147-6 |
Categories: |
Books >
Science & Mathematics >
Mathematics >
Optimization >
General
Promotions
|
LSN: |
1-84821-147-3 |
Barcode: |
9781848211476 |
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!