Lecture Notes in Computer Science

Computational Combinatorial Optimization

Optimal or Provably Near-Optimal Solutions

Editors: Jünger, Michael, Naddef, Denis (Eds.)

Free Preview

Buy this book

eBook $59.99
price for USA in USD (gross)
  • ISBN 978-3-540-45586-8
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $79.99
price for USA in USD
  • ISBN 978-3-540-42877-0
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this Textbook

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.

Table of contents (7 chapters)

Table of contents (7 chapters)
  • General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms

    Martin, Alexander

    Pages 1-25

  • Projection and Lifting in Combinatorial Optimization

    Balas, Egon

    Pages 26-56

  • Mathematical Programming Models and Formulations for Deterministic Production Planning Problems

    Pochet, Yves

    Pages 57-111

  • Lagrangian Relaxation

    Lemaréchal, Claude

    Pages 112-156

  • Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS

    Elf, Matthias (et al.)

    Pages 157-222

Buy this book

eBook $59.99
price for USA in USD (gross)
  • ISBN 978-3-540-45586-8
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $79.99
price for USA in USD
  • ISBN 978-3-540-42877-0
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Computational Combinatorial Optimization
Book Subtitle
Optimal or Provably Near-Optimal Solutions
Editors
  • Michael Jünger
  • Denis Naddef
Series Title
Lecture Notes in Computer Science
Series Volume
2241
Copyright
2001
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-45586-8
DOI
10.1007/3-540-45586-8
Softcover ISBN
978-3-540-42877-0
Series ISSN
0302-9743
Edition Number
1
Number of Pages
X, 310
Topics