Learn IT - Books tags combinatorial

Combinatorial Optimization: Theory and Algorithms (Algorithms and Combinatorics)

Springer, 2005

This well-written textbook on combinatorial optimization puts special emphasis on theoretical results and algorithms with provably good performance, in contrast to heuristics. The book contains complete (but concise) proofs, as well as many deep results, some of which have not appeared in any previous books.

...

Advances in Multi-Objective Nature Inspired Computing (Studies in Computational Intelligence)

Springer, 2010

The purpose of this book is to collect contributions that deal with the use of nature inspired metaheuristics for solving multi-objective combinatorial optimization problems. Such a collection intends to provide an overview of the state-of-the-art developments in this field, with the aim of motivating more researchers in operations research,...

Chemogenomics in Drug Discovery: A Medicinal Chemistry Perspective, Volume 22 (Methods and Principles in Medicinal Chemistry)

John Wiley & Sons, 2004

Chemogenomics brings together the most powerful concepts in modern chemistry and biology, linking combinatorial chemistry with genomics and proteomics. The first reference devoted to the topic, this up-to-date resource covers all stages of the early drug discovery process, from target selection to compound library and lead design. With the...

Geometric Problems on Maxima and Minima

Birkhauser, 2005

Questions of maxima and minima have great practical significance, with applications to physics, engineering, and economics; they have also given rise to theoretical advances, notably in calculus and optimization. Indeed, while most texts view the study of extrema within the context of calculus, this carefully constructed problem book takes a...

Advanced Number Theory

Dover Publications, 1980

Eminent mathematician/teacher approaches algebraic number theory from historical standpoint. Demonstrates how concepts, definitions, theories have evolved during last 2 centuries. Abounds with numerical examples, over 200 problems, many concrete, specific theorems. Includes numerous graphs and tables.

The prerequisites for this book...

Combinatorial Optimization and Applications: Second International Conference, COCOA 2008, St. John's, NL, Canada, August 21-24, 2008, Proceedings

Springer, 2008

The papers in this volume were presented at the Second International Conference on Combinatorial Optimization and Applications (COCOA 2008), held August 21–24, 2008, in St. John’s, Newfoundland, Canada. The topics cover most areas in combinatorial optimization and applications.

A total of 84 papers were submitted, of which 44...

Graphs, Networks and Algorithms (Algorithms and Computation in Mathematics)

Springer, 2012

From the reviews of the previous editions

".... The book is a first class textbook and seems to be indispensable for everybody who has to teach combinatorial optimization. It is very helpful for students, teachers, and researchers in this area. The author finds a striking synthesis of nice and interesting...

Combinatorial Image Analysis: 12th International Workshop, IWCIA 2008, Buffalo, NY, USA, April 7-9, 2008, Proceedings

Springer, 2008

This volume constitutes the refereed proceedings of the 12th International Workshop on Combinatorial Image Analysis, IWCIA 2008, held in Buffalo, NY, USA, in April 2008.

The 28 revised full papers and 10 revised poster papers presented were carefully reviewed and selected from 117 initial submissions. The papers are organized in topical...

Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications (Applied Optimization)

Springer, 2002

This monograph has grown from my PhD thesis Interior point Methods for Semidefinite Programming [39] which was published in December 1997. Since that time, Semidefinite Programming (SDP) has remained a popular research topic and the associated body of literature has grown considerably. As SDP has proved such a useful tool in many applications, like...

Evolutionary Computation in Combinatorial Optimization: 6th European Conference, EvoCOP 2006

Springer, 2006

Metaheuristics have often been shown to be effective for difficult combinatorial optimization problems appearing in various industrial, economical, and scientific domains. Prominent examples of metaheuristics are evolutionary algorithms, simulated annealing, tabu search, scatter search, memetic algorithms, variable neighborhood search, iterated...

Metaheuristics: Progress in Complex Systems Optimization (Operations Research/Computer Science Interfaces Series)

Springer, 2007

Metaheuristics has grown and continues to grow steadily. Seen both from the technical point of view and from the application-oriented side, these optimization tools have established their value in a remarkable story of success. Researchers have demonstrated the ability of these methods to solve hard combinatorial problems of practical sizes within...

Probability and Algorithms

National Academy Press, 1992

Some of the hardest computational problems have been successfully attacked through the use of probabilistic algorithms, which have an element of randomness to them. Concepts from the field of probability are also increasingly useful in analyzing the performance of algorithms, broadening our understanding beyond that provided by the...

Result Page: 13 12 11 10 9 8 7 6 5 4 3 2 1