**Essentials of Metaheuristics**

by Sean Luke

2009**Number of pages**: 233

**Description**:

This is an open set of lecture notes on metaheuristics algorithms, intended for undergraduate students, practitioners, programmers, and other non-experts. It was developed as a series of lecture notes for an undergraduate course. The topics are short and light on examples and theory.

Download or read it online for free here:

**Download link**

(5.3MB, PDF)

## Similar books

**Problem Solving with Algorithms and Data Structures Using Python**

by

**Brad Miller, David Ranum**-

**Franklin, Beedle & Associates**

This textbook is designed as a text for a first course on data structures and algorithms, taught as the second course in the computer science curriculum. We cover abstract data types and data structures, writing algorithms, and solving problems.

(

**13485**views)

**Modern Computer Arithmetic**

by

**Richard P. Brent, Paul Zimmermann**-

**LORIA**

This book collects in the same document all state-of-the-art algorithms in multiple precision arithmetic (integers, integers modulo n, floating-point numbers). The book will be useful for graduate students in computer science and mathematics.

(

**13335**views)

**Data Structures and Algorithms**

by

**John Morris**

The text focuses on data structures and algorithms for manipulating them. Data structures for storing information in tables, lists, trees, queues and stacks are covered. Some basic graph and discrete transform algorithms are also discussed.

(

**13240**views)

**LEDA: A Platform for Combinatorial and Geometric Computing**

by

**K. Mehlhorn, St. NĂ¤her**-

**Cambridge University Press**

The book treats the architecture, the implementation, and the use of the LEDA system. LEDA is a library of efficient data types and algorithms and a platform for combinatorial and geometric computing, written in C++ and freely available worldwide.

(

**8225**views)