Concepts 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.

  • Delivery

    ₹75 shipping all over India

  • Secure Payment

    100% Secure Payment

7,035.0016,750.00

In stock

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.

Weight 1 kg
Dimensions 23 × 15 × 2 cm
Book Author

Vangelis Th. Paschos

Edition

1st

Format

Hardback

ISBN

9781848216563

Language

English

Pages

408

Publication Year

Publisher

Customer Reviews

There are no reviews yet.

Be the first to review “Concepts of Combinatorial Optimization”

Your email address will not be published. Required fields are marked *