Computational Combinatorial Optimization - Optimal or Provably Near-Optimal Solutions (Paperback, 2001 ed.)

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.

General

Imprint:	Springer-Verlag
Country of origin:	Germany
Series:	Lecture Notes in Computer Science, 2241
Release date:	2001
First published:	2001
Editors:	Michael Junger • Denis Naddef
Dimensions:	279 x 216 x 17mm (L x W x T)
Format:	Paperback
Pages:	310
Edition:	2001 ed.
ISBN-13:	978-3-540-42877-0
Categories:	Books > Science & Mathematics > Mathematics > Optimization > General Promotions
LSN:	3-540-42877-1
Barcode:	9783540428770

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!