On the structure of convolutional and cyclic convolutional codes. - Cornelis Roos (IEEE Trans. Inf. Theory, 1979)

On t-constant codes and designs. - Cornelis Roos (IEEE Trans. Inf. Theory, 1981)

Upper bounds for A(n, 4) and A(n, 6) derived from Delsarte's linear programming bound. - Cees Roos; Cornelis de Vroedt (Discret. Math., 1982)

A Generalization of the BCH Bound for Cyclic Codes, Including the Hartmann-Tzeng Bound. - Cees Roos (J. Comb. Theory A, 1982)

On the existence of certain distance-regular graphs. - Cornelis Roos; A. J. van Zanten (J. Comb. Theory B, 1982)

A note on the existence of perfect constant weight codes. - Cees Roos (Discret. Math., 1983)

A new lower bound for the minimum distance of a cyclic code. - Cornelis Roos (IEEE Trans. Inf. Theory, 1983)

On the existence of certain generalized Moore geometries, part I. - Cees Roos; A. J. van Zanten (Discret. Math., 1984)

On the existence of certain generalized Moore geometries, part II. - Cees Roos; A. J. van Zanten (Discret. Math., 1984)

On the existence of certain generalized Moore geometries, part III. - Cees Roos; A. J. van Zanten (Discret. Math., 1986)

On the existence of certain generalized moore geometries (Part IV). - Cees Roos; A. J. van Zanten; M. J. Coster (Discret. Math., 1986)

On the existence of certain generalized Moore geometries, V. - R. M. Damerell; Cees Roos; A. J. van Zanten (Discret. Math., 1989)

An Exponential Example for Terlaky's Pivoting Rule for the Criss-Cross Simplex Method. - Cees Roos (Math. Program., 1990)

A survey of search directions in interior point methods for linear programming. - Dick den Hertog; Cees Roos (Math. Program., 1991)

A polynomial method of approximate centers for linear programming. - Kees Roos; Jean-Philippe Vial (Math. Program., 1992)

A build-up variant of the logarithmic barrier method for LP. - Dick den Hertog; Cees Roos; Tamás Terlaky (Oper. Res. Lett., 1992)

Object Delineation in Noisy Images by a Modified Policy-Iteration Method. - Adrie C. M. Dumay; Mariëlle N. A. J. Claessens; Cees Roos; Jan J. Gerbrands; Johan H. C. Reiber (IEEE Trans. Pattern Anal. Mach. Intell., 1992)

A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems. - Dick den Hertog; Cornelis Roos; Tamás Terlaky (SIAM J. Optim., 1992)

A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming. - Dick den Hertog; Cornelis Roos; Jean-Philippe Vial (SIAM J. Optim., 1992)

A Long-Step Barrier Method for Convex Quadratic Programming. - Kurt M. Anstreicher; Dick den Hertog; Cornelis Roos; Tamás Terlaky (Algorithmica, 1993)

Degeneracy in interior point methods for linear programming: a survey. - Osman Güler; Dick den Hertog; Cornelis Roos; Tamás Terlaky; Takashi Tsuchiya (Ann. Oper. Res., 1993)

A logarithmic barrier cutting plane method for convex programming. - Dick den Hertog; John Kaliski; Cees Roos; Tamás Terlaky (Ann. Oper. Res., 1995)

A sufficient condition for self-concordance, with application to some classes of structured convex programming problems. - Dick den Hertog; Florian Jarre; Kees Roos; Tamás Terlaky (Math. Program., 1995)

Primal-dual target-following algorithms for linear programming. - Benjamin Jansen; Cornelis Roos; Tamás Terlaky; Jean-Philippe Vial (Ann. Oper. Res., 1996)

Long-step primal-dual target-following algorithms for linear programming. - Benjamin Jansen; Cornelis Roos; Tamás Terlaky; Jean-Philippe Vial (Math. Methods Oper. Res., 1996)

A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming. - Benjamin Jansen; Cees Roos; Tamás Terlaky (Math. Oper. Res., 1996)

Improved complexity using higher-order correctors for primal-dual Dikin affine scaling. - Benjamin Jansen; Kees Roos; Tamás Terlaky; Yinyu Ye 001 (Math. Program., 1996)

Optimization of nuclear reactor reloading patterns. - Etienne de Klerk; Cornelis Roos; Tamás Terlaky; Tibor Illés; A. J. de Jong; J. Valkó; J. E. Hoogenboom (Ann. Oper. Res., 1997)

A Potential Reduction Approach to the Frequency Assignment Problem. - Joost P. Warners; Tamás Terlaky; Cornelis Roos; Benjamin Jansen (Discret. Appl. Math., 1997)

Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems. - Benjamin Jansen; Kees Roos; Tamás Terlaky; Akiko Yoshise (Math. Program., 1997)

Initialization in semidefinite programming via a self-dual skew-symmetric embedding. - Etienne de Klerk; Cornelis Roos; Tamás Terlaky (Oper. Res. Lett., 1997)

Potential reduction algorithms for structured combinatorial optimization problems. - Joost P. Warners; Tamás Terlaky; Cornelis Roos; Benjamin Jansen (Oper. Res. Lett., 1997)

A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems. - Benjamin Jansen; Cornelis Roos; Tamás Terlaky (SIAM J. Optim., 1997)

Theory and algorithms for linear optimization - an interior point approach. - Cornelis Roos; Tamás Terlaky; Jean-Philippe Vial (Wiley, 1998)

A nonconvex weighted potential function forpolynomial target following methods. - Etienne de Klerk; Cornelis Roos; Tamás Terlaky (Ann. Oper. Res., 1998)

Cyclonomial Number Systems and the Ranking of Lexicographically Ordered Constant-Sum Codes. - Cornelis Roos; A. Snijders; A. J. van Zanten (Ars Comb., 1998)

Polynomial Primal-Dual Affine Scaling Algorithms in Semidefinite Programming. - Etienne de Klerk; Cornelis Roos; Tamás Terlaky (J. Comb. Optim., 1998)

On the Dimension of the Set of Rim Perturbations for Optimal Partition Invariance. - Harvey J. Greenberg; Allen G. Holder; Kees Roos; Tamás Terlaky (SIAM J. Optim., 1998)

Basis- and partition identification for quadratic programming and linear complementarity problems. - Arjan Berkelaar; Benjamin Jansen; Kees Roos; Tamás Terlaky (Math. Program., 1999)

On maximization of quadratic form over intersection of ellipsoids with common center. - Arkadi Nemirovski; Cornelis Roos; Tamás Terlaky (Math. Program., 1999)

Note on a paper of Broyden. - Cornelis Roos; Tamás Terlaky (Oper. Res. Lett., 1999)

New Complexity Analysis of the Primal - Dual Newton Method for Linear Optimization. - Jiming Peng; Cees Roos; Tamás Terlaky (Ann. Oper. Res., 2000)

On Copositive Programming and Standard Quadratic Optimization Problems. - Immanuel M. Bomze; Mirjam Dür; Etienne de Klerk; Cornelis Roos; Arie J. Quist; Tamás Terlaky (J. Glob. Optim., 2000)

A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for P*(kappa) Linear Complementarity Problems. - Tibor Illés; Jiming Peng; Cornelis Roos; Tamás Terlaky (SIAM J. Optim., 2000)

A Scaled Gauss–Newton Primal-Dual Search Direction for Semidefinite Optimization. - Etienne de Klerk; Jiming Peng; Cees Roos; Tamás Terlaky (SIAM J. Optim., 2001)

Self-regularity - a new paradigm for primal-dual interior-point algorithms. - Jiming Peng; Cornelis Roos; Tamás Terlaky (Princeton University Press, 2002)

A new class of polynomial primal-dual methods for linear and semidefinite optimization. - Jiming Peng; Cornelis Roos; Tamás Terlaky (Eur. J. Oper. Res., 2002)

Self-regular functions and new search directions for linear and semidefinite optimization. - Jiming Peng; Cornelis Roos; Tamás Terlaky (Math. Program., 2002)

A primal-dual interior-point method for linear optimization based on a new proximity function. - Yan-Qin Bai; Cees Roos; Mohamed El Ghami (Optim. Methods Softw., 2002)

A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier. - Yan-Qin Bai; Mohamed El Ghami; Cornelis Roos (SIAM J. Optim., 2002)

Robust Solutions of Uncertain Quadratic and Conic-Quadratic Problems. - Aharon Ben-Tal; Arkadi Nemirovski; Cees Roos (SIAM J. Optim., 2002)

On the Convergence of the Central Path in Semidefinite Optimization. - Margaréta Halická; Etienne de Klerk; Cees Roos (SIAM J. Optim., 2002)

Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities. - Jiming Peng; Cornelis Roos; Tamás Terlaky (SIAM J. Optim., 2002)

Extended Matrix Cube Theorems with Applications to µ-Theory in Control. - Aharon Ben-Tal; Arkadi Nemirovski; Cornelis Roos (Math. Oper. Res., 2003)

On implementing a primal-dual interior-point method for conic quadratic optimization. - Erling D. Andersen; Cornelis Roos; Tamás Terlaky (Math. Program., 2003)

A polynomial-time algorithm for linear optimization based on a new simple kernel function. - Yan-Qin Bai; Cornelis Roos (Optim. Methods Softw., 2003)

Foreword. - Cornelis Roos; Jianzhong Zhang (Optim. Methods Softw., 2003)

The Robust Shortest Path Problem by Means of Robust Linear Optimization. - Diah Chaerani; Cornelis Roos; A. Aman (OR, 2004)

A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization. - Yan-Qin Bai; Mohamed El Ghami; Cornelis Roos (SIAM J. Optim., 2004)

Primal-Dual Interior-Point Algorithms for Semidefinite Optimization Based on a Simple Kernel Function. - Guo-Qiang Wang; Yan-Qin Bai; Cornelis Roos (J. Math. Model. Algorithms, 2005)

Limiting behavior of the central path in semidefinite optimization. - Margaréta Halická; Etienne de Klerk; Cornelis Roos (Optim. Methods Softw., 2005)

Modelling Some Robust Design Problems via Conic Optimization. - Diah Chaerani; Cornelis Roos (OR, 2006)

A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization. - Cornelis Roos (SIAM J. Optim., 2006)

Simplified O(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps. - Hossein Mansouri; Cornelis Roos (Optim. Methods Softw., 2007)

Primal-dual algorithm for linear optimization problems based on a new class of kernel functions. - Mohamed El Ghami; Ivan Ivanov; Hans Melissen; Cornelis Roos; Trond Steihaug (ISCC, 2008)

Generic Primal-dual Interior Point Methods Based on a New Kernel Function. - Mohamed El Ghami; Cornelis Roos (RAIRO Oper. Res., 2008)

A new full-Newton step O(n) infeasible interior-point algorithm for semidefinite optimization. - Hossein Mansouri; Cornelis Roos (Numer. Algorithms, 2009)

Kernel-function Based Algorithms for Semidefinite Optimization. - Mohamed El Ghami; Yan-Qin Bai; Cornelis Roos (RAIRO Oper. Res., 2009)

Motzkin Transposition Theorem. - Arkadi Nemirovski; Kees Roos (Encyclopedia of Optimization, 2009)

Farkas Lemma. - Kees Roos (Encyclopedia of Optimization, 2009)

Linear Optimization: Theorems of the Alternative. - Kees Roos (Encyclopedia of Optimization, 2009)

Tucker Homogeneous Systems of Linear Relations. - Kees Roos (Encyclopedia of Optimization, 2009)

A generic primal-dual interior-point method for semidefinite optimization based on a new class of kernel functions. - Mohamed El Ghami; Cornelis Roos; Trond Steihaug (Optim. Methods Softw., 2010)

Convergence of the homotopy path for a full-Newton step infeasible interior-point method. - Alireza Asadi; Guoyong Gu; Cornelis Roos (Oper. Res. Lett., 2010)

Counterexample to a Conjecture on an Infeasible Interior-Point Method. - Guoyong Gu; Cornelis Roos (SIAM J. Optim., 2010)

Unified Analysis of Kernel-Based Interior-Point Methods for P*(Kappa)-Linear Complementarity Problems. - Goran Lesaja; Cornelis Roos (SIAM J. Optim., 2010)

The non-existence of some perfect codes over non-prime power alphabets. - Olof Heden; Cornelis Roos (Discret. Math., 2011)

Full Nesterov-Todd step infeasible interior-point method for symmetric optimization. - Guoyong Gu; Maryam Zangiabadi; Cornelis Roos (Eur. J. Oper. Res., 2011)

Kernel-Based Interior-Point Methods for Monotone Linear Complementarity Problems over Symmetric Cones. - Goran Lesaja; Cornelis Roos (J. Optim. Theory Appl., 2011)

Safe Dike Heights at Minimal Costs: The Nonhomogeneous Case. - Ruud Brekelmans; Dick den Hertog; Kees Roos; Carel Eijgenraam (Oper. Res., 2012)

A Full Nesterov-Todd Step Infeasible Interior-Point Method for Second-Order Cone Optimization. - Maryam Zangiabadi; Guoyong Gu; Cees Roos (J. Optim. Theory Appl., 2013)

Economically Efficient Standards to Protect the Netherlands Against Flooding. - Carel Eijgenraam; Jarl Kind; Carlijn Bak; Ruud Brekelmans; Dick den Hertog; Matthijs Duits; Kees Roos; Pieter Vermeer; Wim Kuijken (Interfaces, 2014)

An Improved and Simplified Full-Newton Step O(n) Infeasible Interior-Point Method for Linear Optimization. - Cornelis Roos (SIAM J. Optim., 2015)

Infeasible Interior-Point Methods for Linear Optimization Based on Large Neighborhood. - Alireza Asadi; Cornelis Roos (J. Optim. Theory Appl., 2016)

Optimal Strategies for Flood Prevention. - Carel Eijgenraam; Ruud Brekelmans; Dick den Hertog; Kees Roos (Manag. Sci., 2017)

A Fast Polynomial-time Primal-Dual Projection Algorithm for Linear Programming. - Zhize Li; Wei Zhang; Kees Roos (CoRR, 2018)

An improved version of Chubanov's method for solving a homogeneous feasibility problem. - Kees Roos (Optim. Methods Softw., 2018)

A Universal and Structured Way to Derive Dual Optimization Problem Formulations. - Kees Roos; Marleen Balvert; Bram L. Gorissen; Dick den Hertog (INFORMS J. Optim., 2020)

Using Nemirovski's Mirror-Prox method as basic procedure in Chubanov's method for solving homogeneous feasibility problems. - Zhang Wei; Kees Roos (Optim. Methods Softw., 2022)