Concepts of Combinatorial Optimization (Hardback)Vangelis Th. Paschos (editor)
- We can order this
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.
Publisher: ISTE Ltd and John Wiley & Sons Inc
Number of pages: 416
Weight: 748 g
Dimensions: 243 x 164 x 27 mm
Edition: 2nd Edition
You may also be interested in...
Please sign in to write a review