The theorem of Minkowski for polyhedral monoids and aggregated linear diophantine systems -- Integer rounding and polyhedral decomposition for totally unimodular systems -- Measure extensions according to a given function -- On parametric linear optimization -- On the complexity of clustering problems -- The solution of algebraic assignment and transportation problems -- Application of optimization methods to the solution of operator equations -- A note on directional differentiability of flow network equilibria with respect to a parameter -- On solving symmetric assignment and perfect matching problems with algebraic objectives -- Generating maximum members of independence systems -- Remarks on stochastic aspects on graphs -- On the symmetric travelling salesman problem: Theory and computation -- On the existence and approximation of solutions of pseudomonotone variational inequalities -- Minimum norm solutions of convex programs -- Oracle-algorithms for fixed-point problems โ{128}{148} an axiomatic approach -- The general solution of a classical stochastic inventory problem and its generalization -- On the computational complexity of integer programming problems -- On stability of convex operators -- Differentiable perturbations of infinite optimization problems -- Matroids on the edge sets of directed graphs -- A discrete time maximum principle in a stochastic case -- A class of stationary EOQ problems and learning effects -- Optimal control for a class of integral equations -- On the M/G/1-queue with controlled service rate -- Multiterminal network flow and connectivity in unsymmetrical networks -- Augmented penalty function technique for optimal control problems -- Optimality conditions for the programming problem in infinite dimensions