Review of Introduction to the Design and Analysis of Algorithms by Ananay Levitin, Addison-Wesley
salesman problem. Some of the most important techniques developed in text are applied to solve the examples. This constitutes a nice explanation of the real usage for the presented theory. Conclusion The book is a very well planned and written. It presents a large number of exercises, examples, programming codes, and interesting applications of the theory of linear programming. Having said this, it must be clear that it is not meant to be a complete textbook, but just a complement to existing texts. One of the advantages of giving introductory notes in each section is that, for students who already know the theory, this can become a quick reference for the main results. For professors and interested students, the book can also serve as a source of advanced exercises. An important feature of the book, which sets it apart from other introductory texts, is the inclusion of details about analytical geometry and projective algorithms. This can be confusing to ï¬rst time readers, but for people really interested in knowing the internal mechanisms used by most modern algorithms, this is certainly the way to go. Also, the publication of sample computer code is interesting to many people, and a feature not found in most books about LP. In conclusion, I believe that the book will prove invaluable not only for students, but also for professionals in industry and universities. This is certainly an important addition to the literature of the area of linear programming.