50 Years of Integer Programming 1958-2008

From the Early Years to the State-of-the-Art

Editors: Jünger, M., Liebling, Th.M., Naddef, D., Nemhauser, G.L., Pulleyblank, W.R., Reinelt, G., Rinaldi, G., Wolsey, L.A. (Eds.)

  • Lectures of the pioneers of integer programming

Buy this book

eBook $109.00
price for USA (gross)
  • ISBN 978-3-540-68279-0
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $139.00
price for USA
  • ISBN 978-3-540-68274-5
  • book with DVD
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $139.00
price for USA
  • Customers within the U.S. and Canada please contact Customer Service at 1-800-777-4643, Latin America please contact us at +1-212-460-1500 (Weekdays 8:30am – 5:30pm ET) to place your order.
  • Due: May 13, 2016
  • ISBN 978-3-662-50181-8
  • Free shipping for individuals worldwide
About this book

In 1958, Ralph E. Gomory transformed the field of integer programming when he published a short paper that described his cutting-plane algorithm for pure integer programs and announced that the method could be refined to give a finite algorithm for integer programming. In January of 2008, to commemorate the anniversary of Gomory's seminal paper, a special session celebrating fifty years of integer programming was held in Aussois, France, as part of the 12th Combinatorial Optimization Workshop. This book is based on the material presented during this session.
50 Years of Integer Programming offers an account of featured talks at the 2008 Aussois workshop, namely
- Michele Conforti, Gérard Cornuéjols, and Giacomo Zambelli: Polyhedral Approaches to Mixed Integer Linear Programming
- William Cook: 50+ Years of Combinatorial Integer Programming
- Francois Vanderbeck and Laurence A. Wolsey: Reformulation and Decomposition of Integer Programs
The book contains reprints of key historical articles together with new introductions and historical perspectives by the authors: Egon Balas, Michel Balinski, Jack Edmonds, Ralph E. Gomory, Arthur M. Geoffrion, Alan J. Hoffman & Joseph B. Kruskal, Richard M. Karp, Harold W. Kuhn, and Ailsa H. Land & Alison G. Doig.
It also contains written versions of survey lectures on six of the hottest topics in the field by distinguished members of the integer programming community:
- Friedrich Eisenbrand: Integer Programming and Algorithmic Geometry of Numbers
- Raymond Hemmecke, Matthias Köppe, Jon Lee, and Robert Weismantel: Nonlinear Integer Programming
- Andrea Lodi: Mixed Integer Programming Computation
- Francois Margot: Symmetry in Integer Linear Programming
- Franz Rendl: Semidefinite Relaxations for Integer Programming
- Jean-Philippe P. Richard and Santanu S. Dey: The Group-Theoretic Approach to Mixed Integer Programming
Integer programming holds great promise for the future, and continues to build on its foundations. Indeed, Gomory's finite cutting-plane method for the pure integer case is currently being reexamined and is showing new promise as a practical computational method. This book is a uniquely useful celebration of the past, present and future of this important and active field. Ideal for students and researchers in mathematics, computer science and operations research, it exposes mathematical optimization, in particular integer programming and combinatorial optimization, to a broad audience.

Reviews

From the reviews:

“This volume originates from the 12th Combinatorial Optimization Workshop in Aussois, 2008, where 50 years of integer programming were celebrated. It describes the history and the present state of integer programming. The volume consists of four parts … . This volume is a precious account of the history and the current state of integer programming.” (Rainer Burkard, Mathematical Reviews, Issue 2011 f)

Table of contents (19 chapters)

  • Solution of a Large-Scale Traveling-Salesman Problem

    Chvátal, Vašek (et al.)

    Pages 7-28

  • The Hungarian Method for the Assignment Problem

    Kuhn, Harold W.

    Pages 29-47

  • Integral Boundary Points of Convex Polyhedra

    Hoffman, Alan J. (et al.)

    Pages 49-76

  • Outline of an Algorithm for Integer Solutions to Linear Programs and An Algorithm for the Mixed Integer Problem

    Gomory, Ralph E.

    Pages 77-103

  • An Automatic Method for Solving Discrete Programming Problems

    Land, Ailsa H. (et al.)

    Pages 105-132

Buy this book

eBook $109.00
price for USA (gross)
  • ISBN 978-3-540-68279-0
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Hardcover $139.00
price for USA
  • ISBN 978-3-540-68274-5
  • book with DVD
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $139.00
price for USA
  • Customers within the U.S. and Canada please contact Customer Service at 1-800-777-4643, Latin America please contact us at +1-212-460-1500 (Weekdays 8:30am – 5:30pm ET) to place your order.
  • Due: May 13, 2016
  • ISBN 978-3-662-50181-8
  • Free shipping for individuals worldwide
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
50 Years of Integer Programming 1958-2008
Book Subtitle
From the Early Years to the State-of-the-Art
Editors
  • Michael Jünger
  • Thomas M. Liebling
  • Denis Naddef
  • George L. Nemhauser
  • William R. Pulleyblank
  • Gerhard Reinelt
  • Giovanni Rinaldi
  • Laurence A. Wolsey
Copyright
2010
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-68279-0
DOI
10.1007/978-3-540-68279-0
Hardcover ISBN
978-3-540-68274-5
Softcover ISBN
978-3-662-50181-8
Edition Number
1
Number of Pages
XX, 804
Topics