Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions: 2241 (Lecture Notes in Computer Science)

Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions: 2241 (Lecture Notes in Computer Science)

by Denis Naddef (Author), Denis Naddef (Author), Michael J??nger (Author)

Synopsis

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.

$57.10

Save:$17.15 (23%)

Quantity

20+ in stock

More Information

Format: Paperback
Pages: 320
Edition: 2001
Publisher: Springer
Published: 21 Nov 2001

ISBN 10: 3540428771
ISBN 13: 9783540428770