Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions

·
· Springer
Libro electrónico
310
Páxinas

Acerca deste libro electrónico

This tutorial contains written versions of seven lectures on Computational Combinatorial Optimization given by leading members of the optimization community. The lectures introduce modern combinatorial optimization techniques, with an emphasis on branch and cut algorithms and Lagrangian relaxation approaches. Polyhedral combinatorics as the mathematical backbone of successful algorithms are covered from many perspectives, in particular, polyhedral projection and lifting techniques and the importance of modeling are extensively discussed. Applications to prominent combinatorial optimization problems, e.g., in production and transport planning, are treated in many places; in particular, the book contains a state-of-the-art account of the most successful techniques for solving the traveling salesman problem to optimality.

Valora este libro electrónico

Dános a túa opinión.

Información de lectura

Smartphones e tabletas
Instala a aplicación Google Play Libros para Android e iPad/iPhone. Sincronízase automaticamente coa túa conta e permíteche ler contido en liña ou sen conexión desde calquera lugar.
Portátiles e ordenadores de escritorio
Podes escoitar os audiolibros comprados en Google Play a través do navegador web do ordenador.
Lectores de libros electrónicos e outros dispositivos
Para ler contido en dispositivos de tinta electrónica, como os lectores de libros electrónicos Kobo, é necesario descargar un ficheiro e transferilo ao dispositivo. Sigue as instrucións detalladas do Centro de Axuda para transferir ficheiros a lectores electrónicos admitidos.