ENGLISH

Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions

By Michael Jünger , Alexander Martin (auth.) , Denis Naddef (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2001
ISBN
9783540428770, 3540428771
DOI
10.1007/3-540-45586-8
Open Library ID
OL9446016M
Language
english
Format
DJVU
Filesize
912 kB (933608 bytes)
Series
Lecture Notes in Computer Science 2241
Edition
1
Pages
310\100
Time added
2014-10-05 02:30:00
Discrete Mathematics in Computer Science; Algorith

Description

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.

Similar books