Kategoria BISAC: Mathematics >> Linear & Nonlinear Programming

Linear programming (LP), modeling, and optimization are very much the fundamentals of OR, and no academic program is complete without them. No matter how highly developed one's LP skills are, however, if a fine appreciation for modeling isn't developed to make the best use of those skills, then the truly 'best solutions' are often not realized, and efforts go wasted.

Katta Murty studied LP with George Dantzig, the father of linear programming, and has written the graduate-level solution to that problem. While maintaining the rigorous LP instruction required, Murty's new book is...

In the field of genetic and evolutionary algorithms (GEAs), much theory and empirical study has been heaped upon operators and test problems, but problem representation has often been taken as given. This monograph breaks with this tradition and studies a number of critical elements of a theory of representations for GEAs and applies them to the empirical study of various important idealized test functions and problems of commercial import. The book considers basic concepts of representations, such as redundancy, scaling and locality and describes how GEAs'performance is influenced. Using...

Today most computer scientists believe that NP-hard problems cannot be solved by polynomial-time algorithms. From the polynomial-time perspective, all NP-complete problems are equivalent but their exponential-time properties vary widely. Why do some NP-hard problems appear to be easier than others? Are there algorithmic techniques for solving hard problems that are significantly faster than the exhaustive, brute-force methods? The algorithms that address these questions are known as exact exponential algorithms.

The history of exact exponential algorithms for NP-hard problems dates back...

In 1915 and 1916 Emmy Noether was asked by Felix Klein and David Hilbert to assist them in understanding issues involved in any attempt to formulate a general theory of relativity, in particular the new ideas of Einstein. She was consulted particularly over the difficult issue of the form a law of conservation of energy could take in the new theory, and she succeeded brilliantly, finding two deep theorems.

But between 1916 and 1950, the theorem was poorly understood and Noether's name disappeared almost entirely. People like Klein and Einstein did little more then mention her name in...

Bioinspired computation methods such as evolutionary algorithms and ant colony optimization are being applied successfully to complex engineering problems and to problems from combinatorial optimization, and with this comes the requirement to more fully understand the computational complexity of these search heuristics. This is the first textbook covering the most important results achieved in this area.

The authors study the computational complexity of bioinspired computation and show how runtime behavior can be analyzed in a rigorous way using some of the best-known combinatorial...