Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions

·
· Springer
Ebook
310
pagine

Informazioni su questo ebook

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.

Valuta questo ebook

Dicci cosa ne pensi.

Informazioni sulla lettura

Smartphone e tablet
Installa l'app Google Play Libri per Android e iPad/iPhone. L'app verrà sincronizzata automaticamente con il tuo account e potrai leggere libri online oppure offline ovunque tu sia.
Laptop e computer
Puoi ascoltare gli audiolibri acquistati su Google Play usando il browser web del tuo computer.
eReader e altri dispositivi
Per leggere su dispositivi e-ink come Kobo e eReader, dovrai scaricare un file e trasferirlo sul dispositivo. Segui le istruzioni dettagliate del Centro assistenza per trasferire i file sugli eReader supportati.