Quantum computers have demonstrable ability to solve problems at a scale beyond brute-
force classical simulation. Interest in quantum algorithms has developed in many areas …

Recent years have witnessed great advancements in the science and technology of
autonomy, robotics, and networking. This paper surveys recent concepts and algorithms for …

A unified view of metaheuristics This book provides a complete background on
metaheuristics and shows readers how to design and implement efficient algorithms to solve …

Research in metaheuristics for combinatorial optimization problems has lately experienced
a noteworthy shift towards the hybridization of metaheuristics with other techniques for …

Swarm intelligence is a relatively new approach to problem solving that takes inspiration
from the social behaviors of insects and of other animals. In particular, ants have inspired a …

XII Preface solution as efficiently as possible. Most of the problems we treat have a good
algorithmic solution, but we also show how even difficult problems can be treated (for …

We discuss fast exponential time solutions for NP-complete problems. We survey known
results and approaches, we provide pointers to the literature, and we discuss several open …

This thesis introduces the novel paradigm of" constraint integer programming"(CIP), which
integrates constraint programming (CP) and mixed integer programming (MIP) modeling …

Many optimization problems of practical interest are computationally intractable. Therefore, a
practical approach for solving such problems is to employ heuristic (approximation) …

The status of the P versus NP problem Page 1 78 commuNicaTioNS of The acm |
SePteMber 2009 | voL. 52 | No. 9 review articles Doi:10.1145/1562164.1562186 It’s one of …