Optimization Stories

Martin Grötschel

doi:10.4171/dms/6

p. 460
Contents
pp. 1–2
Preface
pp. 3–5
Introduction
Martin Grötschel
pp. 7–8
Stories about the old masters of optimization
Martin Grötschel
pp. 9–14
Jiu Zhang Suan Shu and the Gauss algorithm for linear equations
Ya-Xiang Yuan
pp. 15–18
Leibniz and the brachistochrone
Eberhard Knobloch
pp. 19–23
Leibniz and the infinite
Eberhard Knobloch
pp. 25–30
A short history of Newton's method
Peter Deuflhard
pp. 31–35
Euler and infinite speed
Eberhard Knobloch
pp. 37–42
Euler and variations
Eberhard Knobloch
pp. 43–50
Euler, Mei-ko Kwan, Königsberg, and a Chinese postman
Martin GrötschelYa-Xiang Yuan
pp. 55–64
Who invented the interior-point method?
David Shanno
pp. 65–73
Column generation for linear and integer programming
George L. Nemhauser
pp. 75–85
Who solved the Hirsch conjecture?
Günter M. Ziegler
pp. 87–93
Pope Gregory, the calendar, and continued fractions
Friedrich Eisenbrand
pp. 95–106
Löwner–John ellipsoids
Martin Henk
pp. 107–121
A brief history of linear and mixed-integer programming computation
Robert E. Bixby
pp. 127–141
The origins of minimal spanning tree algorithms – Borůvka and Jarník
Jaroslav NesetrilHelena Nesetrilová
pp. 143–153
The coming of the matroids
William H. Cunningham
pp. 155–167
On the history of the shortest path problem
Alexander Schrijver
pp. 169–180
On the history of the transportation and maximum flow problems
Alexander Schrijver
pp. 181–197
Edmonds, matching and the birth of polyhedral combinatorics
William R. Pulleyblank
pp. 199–210
Flinders Petrie, the travelling salesman problem, and the beginning of mathematical modeling in archaeology
Thomas L. GertzenMartin Grötschel
pp. 211–219
D. Ray Fulkerson and project scheduling
Rolf H. Möhring
pp. 221–226
The ongoing story of Gomory cuts
Gérard Cornuéjols
pp. 227–238
Markowitz and Manne + Eastman + Land and Doig = branch and bound
William Cook
pp. 239–245
Ronald Graham: laying the foundations of online optimization
Susanne Albers
pp. 251–254
Cauchy and the gradient method
Claude Lemaréchal
pp. 255–269
William Karush and the KKT theorem
Richard W. Cottle
pp. 271–276
Nelder, Mead, and the other simplex method
Margaret H. Wright
pp. 277–290
Subgradient optimization in nonsmooth optimization (including the soviet revolution)
Jean-Louis Goffin
pp. 291–300
A science fiction story in nonsmooth optimization originating at IIASA
Robert MifflinClaudia Sagastizábal
pp. 301–315
Broyden updating, the good and the bad!
Andreas Griewank
pp. 317–329
Carathéodory on the road to the maximum principle
Hans Josef Pesch
pp. 331–343
The cold war and the maximum principle of optimal control
Hans Josef PeschMichael Plail
pp. 345–356
The princess and infinite-dimensional optimization
Hans Josef Pesch
pp. 359–376
A brief history of NP-completeness, 1954–2012
David S. Johnson
pp. 377–388
On the evolution of optimization modeling systems
Robert Fourer
pp. 389–400
Who invented the reverse mode of differentiation?
Andreas Griewank
pp. 401–415
Gordon Moore and his law: numerical methods to the rescue
Raúl Rojas
pp. 419–431
Voronoi diagrams and Delaunay triangulations: ubiquitous siamese twins
Thomas M. LieblingLionel Pournin
pp. 433–438
Around Hilbert’s 17th problem
Konrad Schmüdgen
pp. 439–446
From Kepler to Hales, and back to Hilbert
Michael Joswig
pp. 447–453
Vilfredo Pareto and multi-objective optimization
Matthias Ehrgott
pp. 455–460
Optimisation and utility functions
Walter Schachermayer