Complexity in numerical optimization

Average performance of self-dual interior point algorithm for linear programming, K.M. Anstreicher et al the complexity of approximating a nonlinear program, M. Bellare and P. Rogaway algorithms for the least distance problem, P. Berman et al translational cuts for convex minimization, J.V. Burke et al maximizing concave functions in fixed dimension, E. Cohen and N. Megiddo the complexity of allocating resources in parallel - upper and lower bounds, E.J. Friedman complexity issues in nonconvex network flow problems, G. Guisewite and P.M. Pardalos a classification of static scheduling problems, J.W. Herrmann et al complexity of single machine dual criteria and hierarchical scheduling - a survey, C.-Y. Lee and G. Vairaktarakis performance driven graph enhancement problems, D. Paik and S. Sahni weighted means of cuts, parametric flows and fractional combinatorial optimization, T. Radzik some complexity issues involved in the construction of test cases for NP-hard problems, L. Sanchis a note on the complexity of fixed-point computation for noncontractive maps, C.W. Tsai and K. Sikorski maximizing non-linear concave functions in fixed dimension, S. Toledo polynomial time weak approximation algorithms for quadratic programming, S. Vavasis complexity results for a class of min-max problems with robust optimization applications, G. Yu and P. Kouvelis. (Part contents).