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.