Cutting planes (cuts) are very popular in the OR community, where they are
used to strengthen the Linear Programming (LP) relaxation of Mixed-Integer
Programs (MIPs) in the hope of improving the performance of an exact LPbased
solver. In particular, an intense research effort has been devoted to the
study of families of general cuts,...
The theory of computing provides computer science with concepts, models, and formalisms for reasoning about both the resources needed to carry out computations and the efficiency of the computations that use these resources. It provides tools to measure the difficulty of combinatorial problems both absolutely and in comparison with other...
Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical applications. It is the first book to comprehensively study both approximation algorithms and metaheuristics.
Algorithms specify the way computers process information and how they execute tasks. Many recent technological innovations and achievements rely on algorithmic ideas – they facilitate new applications in science, medicine, production, logistics, traffic, communi¬cation and entertainment. Efficient algorithms not only enable your...
Many enterprises regard system-level testing as the final piece of the development effort, rather than as a tool that should be integrated throughout the development process. As a consequence, test teams often execute critical test plans just before product launch, resulting in much of the corrective work being performed in a rush and at the...
We have been very pleased, beyond our expectations, with the reception of
the first edition of this book. Bioinformatics, however, continues to evolve
very rapidly, hence the need for a new edition. In the past three years, fullgenome
sequencing has blossomed with the completion of the sequence of
the fly and the first draft of the...
This book contains the papers of the 7th Computer and Games Conference
(CG 2010) held in Kanazawa, Japan. The conference took place during
September 24–26, 2010 in conjunction with the 15th Computer Olympiad and
the 17th World Computer Chess Championship.
The Computer and Games conference series is a major international...
Wiley-Interscience Series in Discrete Mathematics and Optimization Advisory Editors Ronald L. Graham Jan Karel Lenstra Robert E. Tarjan Discrete Mathematics and Optimization involves the study of finite structures. It is one of the fastest growing areas in mathematics today. The level and depth of recent advances in the area and the wide...
For a long time computer scientists have distinguished between fast and slow algorithms. Fast (or good) algorithms are the algorithms that run in polynomial time, which means that the number of steps required for the algorithm to solve a problem is bounded by some polynomial in the length of the input. All other algorithms are slow (or bad)....
R.E. Miller: Parallel program schemata.- D.E. Muller: Theory of automata.- R. Karp: Computational complexity of combinatorial and graph-theoretic problems.
In this lecture we discuss a type of computer organization which is
based upon the concept of operation sequencing being controlled by operand
availability. Such sequencing...
Computational experiments on algorithms can supplement theoretical analysis by showing what algorithms, implementations, and speed-up methods work best for specific machines or problems. This book guides the reader through the nuts and bolts of the major experimental questions: What should I measure? What inputs should I test? How do I...
Nature has solved its most complicated problem, the creation, variation, and improvement
of living organisms, in a simple and efficient manner. Starting from primitive forms in
earth history, mutation and crossover produced variations that had to struggle for their
existence and to compete with their ancestors and genetically...
