The design of approximation algorithms for spanning tree problems has become an exciting and important area of theoretical computer science and also plays a sig

The design of approximation algorithms for spanning tree problems has become an exciting and important area of theoretical computer science and also plays a sig

With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual

The last few years have seen important advances in the use ofgenetic algorithms to address challenging optimization problems inindustrial engineering. Genetic A

This comprehensive handbook brings together experts who use optimization to solve problems that arise in telecommunications. It is the first book to cover in de