On the volume of an n-dimensional simplex / C. RoosA new pivoting rule for the dual network simplex method / C. RoosAn exponential example for Terlaky's pivoting rule for the criss-cross simplex method / C. RoosAn extension of the MS pivoting rule to capacitated network flow problems / C. Roos and M. TegzeLinear programming along the trajectory of the problem / C. RoosOn the trajectory of a linear programming problem / C. RoosA new, trajectory following polynomial-time algorithm for the linear programming problem / C. RoosLinear programming along the trajectory of the problem in polynomial time / C. RoosThe influence of the potential function on the performance of a trajectory following algorithm for the linear programming problem / C. RoosAn O(n3L) approximate center method for linear programming / C. RoosA polynomial method of approximate centers for linear programming / C. Roos and J.-Ph. VialAnalytic centers in linear programming / C. Roos and J.-Ph. VialA polynomial method of approximate weighted centers for linear programming / C. Roos and D. den HertogLong steps with the logarithmic penalty barrier function in linear programming / C. Roos and J.-Ph. VialA projective variant of the approximate center method for linear programming / C. RoosAchievable potential reductions in the method of Kojima et al. in the case of linear programming / C. Roos and J.-Ph. VialInterior-point methods for linear programming / C. Roos, J.-Ph. VialAdvances in linear optimization : (annotated bibliography) / C. Roos, T. TerlakyModelleren en optimaliseren met wiskunde : beoefening van wiskunde in het spoor van Newton / C. RoosDe tijd zal het leren / C. RoosRegularities of rings / door Cornelis RoosOn Karmarkar's projective method for linear programming / by C. Roos
author
A survey of search directions in interior point methods for linear programming / D. den Hertog and C. RoosAn O(√n) complexity reduction for the long-step path-following algorithm for linear programming / D. den Hertog, C. Roos and J.-Ph. VialA potential reduction method for a class of smooth convex programming problems / D. den Hertog, C. Roos and T. TerlakyA potential reduction variant of renegar's short-step path-following method for linear programming / D. den Hertog, C. Roos and T. TerlakyA polynomial method of weighted centers for convex quadratic programming / D. den Hertog, C. Roos and T. TerlakyOn the classical logarithmic barrier function method for a class of smooth convex programming problems / D. den Hertog, C. Roos and T. TerlakyThe linear complementarity problem, sufficient matrices and the criss-cross method / D. den Hertog, C. Roos and T. TerlakyInverse barrier methods for linear programming / D. den Hertog, C. Roos and T. TerlakyA build-up variant of the path-following method for LP / D. den Hertog, C. Roos, T. TerlakyIri's polynomiality proof for the IRI-IMAI method recast / D. den Hertog, C. Roos, T. TerlakyAn interior point approach to postoptimal and parametric analysis in linear programming / B. Jansen, C. Roos, T. TerlakyThe theory of linear programming: skew symmetric self-dual problems and the central path / B. Jansen, C. Roos, T. TerlakyA polynomial primal-dual Dikin-type algorithm for linear programming / B. Jansen, C. Roos, T. TerlakyA family of polynomial affine scaling algorithms for positive semi-definite linear complementarity problems / B. Jansen, C. Roos, T. TerlakyConvergence of the dual variables for the primal affine scaling method with unit steps in the homogeneous case / I.I. Dikin, C. RoosA short survey on ten years interior point methods / B. Jansen, C. Roos, T. TerlakyA new algorithm for the computation of the smallest eigenvalue of a symmetric matrix and its eigenspace / B. Jansen, C. Roos, T. TerlakyA weighting system for lexicographically ordered constant-sum codes over an arbitrary alphabet / A.J. van Zanten, C. Roos, A. SnijdersA nonconvex weighted potential function for polynomial target following methods / E. de Klerk, C. Roos, T. TerlakySemi-definite problems in truss topology optimization / E. de Klerk, C. Roos, T. TerlakyInitialization in semidefinite programming via a self-dual skew-symmetric embedding / E. de Klerk, C. Roos, T. TerlakyPolynomial primal-dual affine scaling algorithms in semidefinite programming / E. de Klerk, C. Roos, T. TerlakyThe optimal set and optimal partition approach to linear and quadratic programming / Arjan B. Berkelaar, Kees Roos, Tamás TerlakyOn primal-dual path-following algorithms in semidefinite programming / E. de Klerk, C. Roos, T. TerlakyThe optimal set and optimal partition approach to linear and quadratic programming / Arjan B. Berkelaar, Kees Roos and Tamás TerlakyThe optimal set and optimal partition approach to linear and quadratic programming / A.B. Berkelaar, C. Roos, T. TerlakySolving linear systems with low-rank updates / C. Roos ... [et al.]Complexity analysis of a logarithmic barrier decomposition method for semi-infinite linear programming / Zhi-Quan Luo, Kees Roos, Tamás TerlakyOn maximization of quadratic form over intersection of ellipsoids with common center / A. Nemirovski, C. Roos and T. TerlakyNew complexity analysis of primal-dual method for semidefinite optimization based on the NT-direction / J. Peng, C. Roos, T. TerlakyOn convex quadratic approximation / by Dick den Hertog, Etienne de Klerk and Kees RoosStandaardisatie olfactometers / [auteurs C. Roos ... et al. ; uitgevoerd door de Organisatie voor Toegepast Natuurwetenschappelijk Onderzoek, Hoofdgroep Maatschappelijke Technologie ; in opdracht van het Ministerie van Volkshuisvesting, Ruimtelijke Ordening en Milieubeheer]The 5th World microcomputer chess championship, september 7-15, 1985 : World Trade Centre Amsterdam / red. C. Roos, T. Sibbing