Algorithms Books

This book is a study of algorithms for decision making with multiple objectives. It is a distillation of recent research in developing methodologies for solving optimal decision problems in economics, and engineering and reflects current research in these areas.

I want to read some information about algoritma for computer programming

There are many interesting items in here that a programmer would find interesting even today, and I'm not just saying that because the author is my dad. However, even a person with no interest in computer programming would greatly enjoy the parts I found most interesting, namely those dealing with constructing random poems, names, jokes, etc. One wonders if an unwitting audience member would recognize that the sonnet he is hearing, talking about "lusty twigs" and other absurdities, was a random concoction made with Dr. Gimpel's algorithms rather than a Shakespearian original.

I am just starting the book. It seems to cover a lot of information I am concerned with.

In my 25-year career in the equipment service business, a few books stand out as being the most noteworthy contributions to the management of service parts. They include Robert G. Brown's Advanced Service Parts Inventory Control (1982), Joseph D. Patton Jr.'s Service Parts Management (1984), and Craig C. Sherbrooke's Optimal Inventory Modeling of Systems: Multi-Echelon Techniques (1992). This new volume by Muckstadt stands to be the most significant contribution to the business of managing service parts since Sherbrooke's volume.

Brown's book teaches the practitioner how to apply the principles and methods developed by him and others to the practical management of service parts. Brown's pioneering work in forecasting and inventory control methodologies forms the basis of current practice across many industries. Patton's volume (along with it's subsequent revisions) is a practitioner's desk reference that provides a convenient overview of the issues and methods employed in the industry from the viewpoint of one with years of experience managing and consulting to the industry. Sherbrooke produced pioneering work in the area of service inventory supply optimization while working at the RAND Corporation for Department of Defense applications in the military. In fact, the most sophisticated service parts supply optimization methodologies in existence today are outgrowths of Sherbrooke's original work at RAND and further research by the Operations Research community.

This new text by Muckstadt is an important contribution in three ways. First, it pulls together in one text much of the significant research related to service parts supply chain optimization to date. Researchers, consultants and practitioners will find that the 260-reference bibliography itself is worth the cost in timesavings in researching the many papers that have been written on the subject. Second, it teaches students of Operations Research the underlying concepts and how to specify and formulate optimization models for service parts applications. Graduate students who complete the material in the text will be well prepared to conduct further research of their own. Finally, Chapters 6 and 10 present valuable new approaches heretofore never published. The time-based service objectives in Chapter 6 directly reflect the manner in which service contracts in high technology industries are written. Decision models that operate in real-time such as those described in Chapter 10 offer the greatest potential for advancing the effectiveness of service parts supply chains.

This is a great book for a first course in applied algebra for both students and former students. This book very nicely integrates introduction+motivation, enough theory, exercises with solutions and hints for computer aided exploration (via Maple, etc). Was used at Stanford for a 100 level course, and fits well in a quarter.

Developing approximation algorithms for NP hard problems is now a very active field in Mathematical Programming and Theoretical Computer Science. This book is actually a collection of survey articles written by some of the foremost experts in this field.

Many of these developments are due to Mathemtical programming (primal dual, semidefinite programming et al). The most exciting of these has been the Goemans and Williamson algorithm for MAX CUT and MAX SAT. A good account of these techniques appears in Chapters 4 and 11.

On the other hand a sequence of unexpected results in complexity culminated in a proof that many of these problems cannot have polynomial approximation algorithms unless P=NP. A good survey of "Hardness of Approximations" appears in Chapter 10, written by Sanjeev Arora and Carsten Lund both of whom were responsible for some original developments in this field.

I am going to purchase a copy of this book and can only strongly recommend it to everyone.

A generation grew up on Knuth, yet many new coders simply do not know who he is.

The Art of Computer Programming is required reading for anyone serious about computer programming, it is as simply as that.

Semidefinite Programming (SDP), which the author remarks is linear programming for the 21st century, has lately been one of the most exciting and active areas of research in the mathematical programming community. This tremendous excitement was spurred in part by the development of efficient interior point methods (IPMs) for the solution of SDPs, and important applications of the SDP especially in combinatorial optimization. I believe Etienne De Klerk gives an excellent introduction to these two topics, in this short, but concise monograph published by Kluwer Academic Publishers.

Topics covered include theory (duality, degeneracy, complementarity, properties of central path), algorithms (primal and primal dual affine scaling, path following, potential reduction algorithms), and finally applications (approximating the stable set and coloring number of a graph, the satisfiability problem, and quadratic programming).

Most of the material presented is based on the personal research of the author with other colloborators, and reflect his personal taste, and various insights on the subject. The monograph is probably the first textbook exclusively devoted to the SDP, and can be used in a graduate course on the subject. Personally, I enjoyed it immensely!.

Preferred by most IITs top brains!
good foundation for Computer science...