- Introduction
- Linear Programming: Simplex Algorithm
and Duality, Primal and Dual Simplex Algorithm, Min Cost Network Flow, Duality,
Sensitivity Analysis, Reoptimization, Totally Unimodular Constraint Matrices
- Weighted Bipartite Matching
- Pricing and Geometric Bipartite Matching, An Implementation
- The Running Time (Worst Case, Average Case, Randomized) of the Simplex Method. Implementations of the Simplex Method
- The Ellipsoid and the Interior Point Method
- The Ellipsoid Method, an improved write-up
- Integer Linear Programming, Gomory Cutting Planes, Traveling Salesman Problem, Cutting Stock Problem, Integer Linear Programming in Finite Dimension
- A Documented Program for the Cutting Stock Problem, The Program
- Bibliography
Prof. Dr. Kurt Mehlhorn
Max-Planck-Institut für Informatik
Algorithms and Complexity Group (AG1)
Im Stadtwald
66123
Saarbrücken
Germany
|