Cover of Michael Junger (EDT), Denis Naddef (EDT): Computational Combinatorial Optimization

Michael Junger (EDT), Denis Naddef (EDT) Computational Combinatorial Optimization

Optimal or Provably Near-Optimal Solutions

Price for Eshop: 1267 Kč (€ 50.7)

VAT 0% included

New

E-book delivered electronically online

E-Book information

Springer Berlin Heidelberg

2003

PDF
How do I buy e-book?

978-3-540-45586-8

3-540-45586-8

Annotation

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.

Ask question

You can ask us about this book and we'll send an answer to your e-mail.