50 Years of Integer Programming 1958-2008

1. Solution of a Large-Scale Traveling-Salesman Problem
Vašek Chvátal, William Cook, George B. Dantzig, Delbert R. Fulkerson, Selmer M. Johnson

2. The Hungarian Method for the Assignment Problem
Harold W. Kuhn

3. Integral Boundary Points of Convex Polyhedra
Alan J. Hoffman, Joseph B. Kruskal

4. Outline of an Algorithm for Integer Solutions to Linear Programs and An Algorithm for the Mixed Integer Problem
Ralph E. Gomory

5. An Automatic Method for Solving Discrete Programming Problems
Ailsa H. Land, Alison G. Doig

6. Integer Programming: Methods, Uses, Computation
Michel Balinski

7. Matroid Partition
Jack Edmonds

8. Reducibility Among Combinatorial Problems
Richard M. Karp

9. Lagrangian Relaxation for Integer Programming
Arthur M. Geoffrion

10. Disjunctive Programming
Egon Balas

11. Polyhedral Approaches to Mixed Integer Linear Programming
Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli

12. Fifty-Plus Years of Combinatorial Integer Programming
William Cook

13. Reformulation and Decomposition of Integer Programs
François Vanderbeck, Laurence A. Wolsey

14. Integer Programming and Algorithmic Geometry of Numbers
Friedrich Eisenbrand

15. Nonlinear Integer Programming
Raymond Hemmecke, Matthias Köppe, Jon Lee, Robert Weismantel

16. Mixed Integer Programming Computation
Andrea Lodi

17. Symmetry in Integer Linear Programming
François Margot

18. Semidefinite Relaxations for Integer Programming
Franz Rendl

19. The Group-Theoretic Approach in Mixed Integer Programming
Jean-Philippe P. Richard, Santanu S. Dey

Avainsanat: Mathematics, Combinatorics, Optimization