Delivery included to the United States

Paradigms of Combinatorial Optimization

Paradigms of Combinatorial Optimization Problems and New Approaches - Mathematics and Statistics Series

Revised and updated 2nd edition

Hardback (29 Jul 2014)

Not available for sale

Out of stock

This service is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Publisher's Synopsis

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 aim 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, presenting basics about worst-case and randomized complexity;
- Classical solution methods, presenting the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming;
- Elements from mathematical programming, presenting fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.

Book information

ISBN: 9781848216570
Publisher: Wiley
Imprint: Wiley-ISTE
Pub date:
Edition: Revised and updated 2nd edition
DEWEY: 519.64
DEWEY edition: 23
Language: English
Number of pages: 720
Weight: 1344g
Height: 164mm
Width: 242mm
Spine width: 49mm