Mathematical Programming at Oberwolfach II

Faces Of Dual Transportation Polyhedra -- A Submodular Network Simplex Method -- Uncapacitated Lot-sizing: The Convex Hull Of Solutions -- Node-weighted Graphs Having The König-egerváry Property -- A Polynomial-time Test For Total Dual Integrality In Fixed Dimension -- Inaccuracy In Quasi-newton Methods: Local Improvement Theorems -- Orientation Of Matrices -- Covering Directed And Odd Cuts -- Submodular Systems And Related Topics -- Inner Estimates For The Generalized Gradient Of The Optimal Value Function In Nonlinear Programming -- Numerical Methods For Basic Solutions Of Generalized Flow Networks -- Modelling With Integer Variables -- Multipoint Methods For Separable Nonlinear Networks -- Normal Solutions Of Linear Programs -- Local Structure Of Feasible Sets In Nonlinear Programming, Part Ii: Nondegeneracy -- Performance Of Approximate Algorithms For Global Minimization -- Some Optimization Problems With Extremal Operations. Edited By Bernhard Korte, Klaus Ritter.