July 4 Weekend Sale | $10 Off. Get the code »

Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions

by ,

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 ...

loading
  • Book Details
  • Seller
Computational Combinatorial Optimization: Optimal or Provably Near-Optimal Solutions
2001, Springer, Berlin, Germany

ISBN-13: 9783540428770

2001 edition

Trade paperback

Select
Filter Results
Shipping
Item Condition
Seller Rating
Other Options
Change Currency